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))).

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

Offset: 0

Author

Roger L. Bagula and Gary W. Adamson, Jun 03 2010

Keywords

• nonn

Links

• G. C. Greubel, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. A002487, A177219, A004001.

Programs

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}]