Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A037091
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A037091 Lexicographically first strictly increasing base 3 autovarious sequence: a(n) = number of distinct a(k) mod 3^n (written in base 3). +0
2
1, 2, 11, 12, 101, 1001, 1002, 1011, 1012, 1101, 10001, 10002, 10011, 10012, 10101, 11001, 11002, 11011, 11012, 11101, 20001, 20002, 20011, 20012, 20101, 21001, 21002, 21011, 100001, 1000001, 1000002, 10000001, 100000001, 100000002 (list; graph; listen)
OFFSET

0,2

COMMENT

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

CROSSREFS

Cf. A037090.

Sequence in context: A034118 A140148 A117547 this_sequence A127303 A068972 A116437

Adjacent sequences: A037088 A037089 A037090 this_sequence A037092 A037093 A037094

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 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research