|
|
|
|
1, 4, 2, 1, 4, 1, 3, 4, 2, 1, 3, 2, 1, 4, 2, 1, 4, 1, 3, 4, 1, 4, 2, 1, 3, 2, 4, 3, 4, 1, 3, 4, 2, 1, 3, 2, 3, 2, 4, 3, 1, 4, 2, 1, 2, 1, 3, 2, 1, 4, 2, 1, 4, 1, 3, 4, 2, 1, 3, 2, 1, 4, 2, 1, 4, 1, 3, 4, 1, 4, 2, 1, 3, 2, 4, 3, 4, 1, 3, 4, 1, 4, 2, 1, 4, 1, 3, 4, 2, 1, 3, 2, 1, 4, 2, 1, 3, 2, 4, 3, 4, 1, 3, 4, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
One symbol per substitution added symmetrically to Dekking's Peano set with order reversed permutation of substitutions.
|
|
LINKS
|
F. M. Dekking, Recurrent Sets, Advances in Mathematics, vol. 44, no.1, April 1982, page 85, section 4.1
|
|
FORMULA
|
4->{1, 4, 2, 1}, 3->{2, 1, 3, 2}, 2->{3, 2, 4, 3}, 1->{4, 1, 3, 4}
|
|
MATHEMATICA
|
s[4] = {1, 4, 2, 1}; s[3] = {2, 1, 3, 2}; s[2] = {3, 2, 4, 3}; s[1] = {4, 1, 3, 4}; t[a_] := Flatten[s /@ a]; p[0] = {1}; p[1] = t[p[0]]; p[n_] := t[p[n - 1]] aa = p[4]
|
|
CROSSREFS
|
|
|
KEYWORD
|
dead
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|