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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038113 Lexicographically first strictly increasing base 4 autovarious sequence: a(n) = number of distinct a(k) mod 4^n (written in base 4). 0
1, 2, 11, 12, 21, 101, 1001, 1002, 1011, 10001, 10002, 10011, 10012, 10021, 10101, 11001, 11002, 100001, 100002, 100011, 100012, 100021, 100101, 101001, 101002, 101011, 110001, 110002, 110011, 110012, 110021, 110101, 111001, 111002, 200001 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

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

CROSSREFS

Sequence in context: A136999 A053880 A063112 * A089600 A114034 A136970

Adjacent sequences:  A038110 A038111 A038112 * A038114 A038115 A038116

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 17 08:34 EST 2012. Contains 205998 sequences.