login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

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

%I #6 Apr 04 2015 21:46:56

%S 1,2,11,12,21,22,31,101,1001,1002,1011,1012,1021,10001,100001,100002,

%T 100011,100012,100021,1000001,1000002,1000011,1000012,1000021,1000022,

%U 1000031,1000101,1001001,1001002,1001011,1001012,1001021,1010001

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

%C The first a(n) elements include all a(n) residues mod 6^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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)