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!)
A038113 Lexicographically earliest strictly increasing base 4 autovarious sequence: a(n) = number of distinct a(k) mod 4^n (written in base 4). 0

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

%S 1,2,11,12,21,101,1001,1002,1011,10001,10002,10011,10012,10021,10101,

%T 11001,11002,100001,100002,100011,100012,100021,100101,101001,101002,

%U 101011,110001,110002,110011,110012,110021,110101,111001,111002,200001

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

%C The first a(n) elements include all a(n) residues mod 4^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 24 08:59 EDT 2024. Contains 371935 sequences. (Running on oeis4.)