login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025481 a(0) = 0; a(n) = a(n/2)/2 if n = a(n/2) = 0 (mod 2); a(n) = a(n-1)+1 otherwise. 0
0, 1, 2, 3, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 6, 1, 2, 3, 4, 2, 3, 1, 2, 3, 4, 2, 3, 4, 5, 6, 7, 2, 3, 4, 5, 3, 4, 5, 6, 1, 2, 3, 4, 2, 3, 1, 2, 3, 4, 5, 6, 1, 2, 3, 4, 2, 3, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 6, 1, 2, 3, 4, 2, 3, 4, 5, 6, 7, 2, 3, 4, 5, 3, 4, 5, 6, 1, 2, 3, 4, 2, 3, 1, 2, 3, 4, 5, 6, 1, 2 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

CROSSREFS

Sequence in context: A003315 A194107 A071797 * A124171 A076645 A011448

Adjacent sequences:  A025478 A025479 A025480 * A025482 A025483 A025484

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

EXTENSIONS

Bounded, maximum is a(37) = 7.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 15 06:50 EST 2012. Contains 205694 sequences.