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

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

Offset

0,6

Links

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

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

Cf. A002487, A004001, A178770, A178677

Sequence in context: A112223 A324810 A353351 * A289498 A193929 A132881

Adjacent sequences: A178768 A178769 A178770 * A178772 A178773 A178774

Keyword

nonn

Author

Roger L. Bagula, Jun 11 2010

Status

approved