OFFSET
0,17
COMMENTS
Every term is a Fibonacci number (A000045), and every nonnegative Fibonacci number occurs.
FORMULA
The initial 16 terms (0s and 1s) are followed by 16 twos, then 32 threes, then 64 fives,... . Specifically, for m>=3, there are 2^(m+1) F(m)'s.
EXAMPLE
a(20) = a(5) + a(2) + a(1) = 1 + 0 + 1 = 2.
MATHEMATICA
a[0] = 0; a[1] = 1;
a[n_] := a[n] = Sum[a[Floor[n/2^k]], {k, 2, n}]
Table[a[n], {n, 0, 570}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, May 28 2024
STATUS
approved