Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038113
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
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; listen)
OFFSET

0,2

COMMENT

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

CROSSREFS

Adjacent sequences: A038110 A038111 A038112 this_sequence A038114 A038115 A038116

Sequence in context: A136999 A053880 A063112 this_sequence A089600 A114034 A136970

KEYWORD

nonn,base

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research