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

%I #9 Apr 13 2021 22:58:40

%S 1,10,11,101,110,1001,10001,10010,10011,100001,100010,100011,100101,

%T 100110,101001,110001,110010,1000001,10000001,100000001,100000010,

%U 100000011,100000101,100000110,100001001,100010001,100010010,100010011

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

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

%Y Cf. A037091.

%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 21 17:36 EDT 2024. Contains 371874 sequences. (Running on oeis4.)