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!)
A178677 If n mod 2 == 0, a(n) = a(floor(n/2)), otherwise a(n) = a(a(floor((n-1)/2))) + a(n - a(floor((n-1)/2))). 2
0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 4, 3, 4, 1, 2, 2, 3, 2, 4, 3, 4, 2, 5, 4, 5, 3, 6, 4, 6, 1, 2, 2, 3, 2, 4, 3, 4, 2, 5, 4, 5, 3, 6, 4, 6, 2, 7, 5, 6, 4, 8, 5, 7, 3, 7, 6, 10, 4, 8, 6, 9, 1, 2, 2, 3, 2, 4, 3, 4, 2, 5, 4, 5, 3, 6, 4, 6, 2, 7, 5, 6, 4, 8, 5, 7, 3, 7, 6, 10, 4, 8, 6, 9, 2, 10, 7, 7, 5, 4, 6, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
MATHEMATICA
a[0]:= 0; a[1]:= 1; a[2]:= 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-1)/2]]]];
Table[a[n], {n, 0, 100}]
CROSSREFS
Sequence in context: A106487 A105102 A105105 * A366888 A243924 A335474
KEYWORD
nonn
AUTHOR
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 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)