The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A373095 a(n) = a[n/4] + a[n/8] + a[n/16] + ..., where a(0) = 0, a(1) = 1, and [ ] = floor. 2
 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,17 COMMENTS Every term is a Fibonacci number (A000045), and every nonnegative Fibonacci number occurs. LINKS Table of n, a(n) for n=0..85. 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 Cf. A000045, A005187, A072376 (sum starts with a[n/2]), A373096, A373097. Sequence in context: A076620 A121900 A333525 * A056811 A097430 A054900 Adjacent sequences: A373092 A373093 A373094 * A373096 A373097 A373098 KEYWORD nonn AUTHOR Clark Kimberling, May 28 2024 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.

Last modified August 14 23:14 EDT 2024. Contains 375171 sequences. (Running on oeis4.)