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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082479 a(1)=1, a(n)=a(floor(n/2))+a(floor(n/3)). 0
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
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: A219652 A069924 A225559 * A090616 A186704 A067434
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Apr 27 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:25 EDT 2024. Contains 371967 sequences. (Running on oeis4.)