Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A109294
Base-3 analog of A018737. Start with S = {}. For m = 0, 1, 2, 3, ... let u be the ternary expansion of m. If u is not a substring of S, append the minimal number of ternary digits to S to remedy this. Sequence gives S.
0
0, 1, 2, 1, 0, 1, 1, 2, 0, 2, 2, 1, 0, 0, 1, 0, 2, 1, 1, 0, 1, 1, 1, 2, 2, 0, 0, 2, 0, 1, 2, 1, 2, 2, 2, 1, 0, 0, 0, 1, 0, 0, 2, 1, 0, 1, 0, 1, 2, 1, 0, 2, 0, 1, 0, 2, 2, 1, 1, 0, 0, 1, 1, 0, 2, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 2, 0, 0, 1, 2, 0, 1, 2, 1, 1, 2, 2, 1, 2, 0, 0, 0, 2, 0, 1, 1, 2, 0, 2, 0, 2, 1, 2, 1, 2
OFFSET
0,3
CROSSREFS
Cf. A108737.
Sequence in context: A121450 A143110 A319662 * A132966 A037897 A190248
KEYWORD
nonn,base
AUTHOR
John W. Layman, Jun 24 2005
STATUS
approved