login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088468 a(n)=a([n/2])+a([n/3]), n>0. a(0)=1. 8
1, 2, 3, 4, 5, 5, 7, 7, 8, 9, 9, 9, 12, 12, 12, 12, 13, 13, 16, 16, 16, 16, 16, 16, 20, 20, 20, 21, 21, 21, 21, 21, 22, 22, 22, 22, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 33, 33, 33, 33, 33, 33, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 38, 38, 38, 38, 38, 38, 38, 38, 48 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Record values greater than 1 occur at 3-smooth numbers: A160519(n)=a(A003586(n)) and A160519(m)<a(m) for m < A003586(n). - Reinhard Zumkeller, May 16 2009

LINKS

R. Zumkeller, Table of n, a(n) for n = 0..10000

A. R. Lebeck, CPS 104: Homework #3.

PROG

(PARI) a(n)=if(n<1, n==0, a(n\2)+a(n\3))

CROSSREFS

A061984(n) + 1.

A007731, A083662, A165704, A165706. - Reinhard Zumkeller, Sep 26 2009

Sequence in context: A075084 A086593 A073757 * A049448 A130044 A156229

Adjacent sequences:  A088465 A088466 A088467 * A088469 A088470 A088471

KEYWORD

nonn

AUTHOR

Michael Somos, Oct 02 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 18 19:54 EST 2019. Contains 320262 sequences. (Running on oeis4.)