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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038118 Lexicographically first strictly increasing base 9 autovarious sequence: a(n) = number of distinct a(k) mod 9^n (written in base 9). 0
1, 2, 11, 12, 21, 22, 31, 32, 41, 42, 101, 1001, 1002, 1011, 1012, 1021, 1022, 1031, 1032, 10001, 100001, 100002, 100011, 100012, 100021, 100022, 100031, 100032, 1000001, 10000001, 10000002, 10000011, 10000012, 10000021, 10000022 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

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

CROSSREFS

Sequence in context: A136997 A085184 A037089 * A038117 A038116 A101248

Adjacent sequences:  A038115 A038116 A038117 * A038119 A038120 A038121

KEYWORD

nonn,base

AUTHOR

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

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 09:40 EST 2012. Contains 205754 sequences.