|
|
A105778
|
|
Trajectory of 1 under the morphism 1->{1,2,1,2,1}, 2->{4,3,4,3,4}, 3->{2,1,1,1,2}, 4->{3,4,3,4,3}.
|
|
0
|
|
|
1, 2, 1, 2, 1, 4, 3, 4, 3, 4, 1, 2, 1, 2, 1, 4, 3, 4, 3, 4, 1, 2, 1, 2, 1, 3, 4, 3, 4, 3, 2, 1, 1, 1, 2, 3, 4, 3, 4, 3, 2, 1, 1, 1, 2, 3, 4, 3, 4, 3, 1, 2, 1, 2, 1, 4, 3, 4, 3, 4, 1, 2, 1, 2, 1, 4, 3, 4, 3, 4, 1, 2, 1, 2, 1, 3, 4, 3, 4, 3, 2, 1, 1, 1, 2, 3, 4, 3, 4, 3, 2, 1, 1, 1, 2, 3, 4, 3, 4, 3, 1, 2, 1, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Incorrect attempt to recreate something similar to Example (4.1) from the Dekking reference. - Joerg Arndt, May 16 2021
|
|
LINKS
|
F. M. Dekking, Recurrent Sets, Advances in Mathematics, vol. 44, no.1, April 1982, page 85, section 4.1.
|
|
MATHEMATICA
|
n:=5; SubstitutionSystem[{1->{1, 2, 1, 2, 1}, 2->{4, 3, 4, 3, 4}, 3->{2, 1, 1, 1, 2}, 4 ->{3, 4, 3, 4, 3}}, {1}, n][[n]] (* Georg Fischer, May 14 2021 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,less
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|