A160692 Iteration of (k terms=k, followed by 2^k-k terms=0), beginning with k=0.

0, 1, 0, 2, 2, 0, 0, 3, 3, 3, 0, 0, 0, 0, 0, 4, 4, 4, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 5, 5, 5, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 6, 6, 6, 6, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 0

Author

Reinhard Zumkeller, May 24 2009

Keywords

• nonn
• tabf

Comments

For n with 2^k - 1 <= n < 2^k + k-1: a(n) = k;

for n with 2^k + k-1 <= n < 2^(k+1) - 1: a(n) = 0.

Crossrefs

A000225, A083706, A052944, A000918.

Formula

a(n) = f(n,0) with f(n,k) = if n<2^k then (if n

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.