login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038118 Lexicographically earliest strictly increasing base 9 autovarious sequence: a(n) = number of distinct a(k) mod 9^n (written in base 9). 0

%I

%S 1,2,11,12,21,22,31,32,41,42,101,1001,1002,1011,1012,1021,1022,1031,

%T 1032,10001,100001,100002,100011,100012,100021,100022,100031,100032,

%U 1000001,10000001,10000002,10000011,10000012,10000021,10000022

%N Lexicographically earliest strictly increasing base 9 autovarious sequence: a(n) = number of distinct a(k) mod 9^n (written in base 9).

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

%K nonn,base

%O 0,2

%A _David W. Wilson_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 12:36 EDT 2021. Contains 348155 sequences. (Running on oeis4.)