A082479 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A082479

a(1)=1, a(n)=a(floor(n/2))+a(floor(n/3)).

1, 2, 2, 3, 3, 4, 4, 5, 5, 5, 5, 7, 7, 7, 7, 8, 8, 9, 9, 9, 9, 9, 9, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 28, 28, 28, 28, 28, 28

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..77.

FORMULA

a(n)*log(n)/n is bounded.

PROG

(PARI) a(n)=if(n<2, 1, a(floor(n/2))+a(floor(n/3)))

CROSSREFS

Sequence in context: A069924 A377028 A225559 * A090616 A186704 A067434

Adjacent sequences: A082476 A082477 A082478 * A082480 A082481 A082482

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Apr 27 2003

STATUS

approved