Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025481
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
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; listen)
OFFSET

0,3

CROSSREFS

Sequence in context: A033924 A003315 A071797 this_sequence A124171 A076645 A011448

Adjacent sequences: A025478 A025479 A025480 this_sequence A025482 A025483 A025484

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Bounded, maximum is a(37) = 7.

page 1

Search completed in 0.006 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research