Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A037090
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A037090 Lexicographically first strictly increasing base 2 autovarious sequence: a(n) = number of distinct a(k) mod 2^n (written in base 2). +0
2
1, 10, 11, 101, 110, 1001, 10001, 10010, 10011, 100001, 100010, 100011, 100101, 100110, 101001, 110001, 110010, 1000001, 10000001, 100000001, 100000010, 100000011, 100000101, 100000110, 100001001, 100010001, 100010010, 100010011 (list; graph; listen)
OFFSET

0,2

COMMENT

The first a(n) elements include all a(n) residues mod 2^n.

CROSSREFS

Cf. A037091.

Sequence in context: A055611 A077813 A104326 this_sequence A118240 A157845 A086084

Adjacent sequences: A037087 A037088 A037089 this_sequence A037091 A037092 A037093

KEYWORD

nonn,base

AUTHOR

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

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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research