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!)
A178771 a(0)=0, a(1)=1, a(2)=1, a(3)=1, thereafter a(n) = If[Mod[ n, 2] == 0, a(Floor[n/2]), a(a(Floor[(n - 1)/2])) + a(n - a(Floor[( n - 3)/2]))]. 1
0, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 3, 1, 4, 2, 3, 1, 4, 2, 3, 2, 4, 3, 5, 1, 4, 4, 5, 2, 5, 3, 6, 1, 4, 4, 5, 2, 5, 3, 6, 2, 4, 4, 5, 3, 5, 5, 5, 1, 4, 4, 5, 4, 5, 5, 7, 2, 5, 5, 7, 3, 3, 6, 4, 1, 8, 4, 5, 4, 9, 5, 7, 2, 5, 5, 7, 3, 3, 6, 4, 2, 8, 4, 9, 4, 9, 5, 11, 3, 5, 5, 5, 5, 5, 5, 7, 1, 6, 4, 5, 4, 7, 5, 7, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
LINKS
MATHEMATICA
a[0] = 0; a[1] = 1; a[2] = 1; a[3] := 1; a[n_]:= a[n] = If[Mod[n, 2] == 0, a[Floor[n/2]], a[a[Floor[(n-1)/2]]] + a[n -a[Floor[(n-3)/2]]]]; Table[a[n], {n, 0, 200}]
CROSSREFS
Sequence in context: A112223 A324810 A353351 * A289498 A193929 A132881
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Jun 11 2010
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 March 28 17:42 EDT 2024. Contains 371254 sequences. (Running on oeis4.)