Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001069
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001069 Take log_2 of n this many times to get number < 2. +0
1
0, 1, 1, 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, 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, 3, 3, 3, 3, 3, 3, 3 (list; graph; listen)
OFFSET

1,4

CROSSREFS

Adjacent sequences: A001066 A001067 A001068 this_sequence A001070 A001071 A001072

Sequence in context: A090620 A057467 A074594 this_sequence A110591 A105209 A095861

KEYWORD

nonn,easy

AUTHOR

njas and J. H. Conway (conway(AT)math.princeton.edu)

page 1

Search completed in 0.002 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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research