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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A160692 Iteration of (k terms=k, followed by 2^k-k terms=0), beginning with k=0. 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

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.

LINKS

Table of n, a(n) for n=0..90.

FORMULA

a(n) = f(n,0) with f(n,k) = if n<2^k then (if n<k then k else 0) else f(n-2^k,k+1).

CROSSREFS

A000225, A083706, A052944, A000918.

Sequence in context: A109042 A322403 A128540 * A051775 A108036 A190174

Adjacent sequences: A160689 A160690 A160691 * A160693 A160694 A160695

KEYWORD

nonn,tabf

AUTHOR

Reinhard Zumkeller, May 24 2009

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 10 02:09 EST 2022. Contains 358712 sequences. (Running on oeis4.)