%I #22 May 16 2021 06:07:22
%S 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,
%T 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,
%U 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
%N 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}.
%C Incorrect attempt to recreate something similar to Example (4.1) from the Dekking reference. - _Joerg Arndt_, May 16 2021
%H F. M. Dekking, <a href="http://dx.doi.org/10.1016/0001-8708(82)90066-4">Recurrent Sets</a>, Advances in Mathematics, vol. 44, no.1, April 1982, page 85, section 4.1.
%H G. A. Edgar and Jeffery Golds, <a href="http://arxiv.org/abs/math/9806039">A Fractal Dimension Estimate for a Graph-Directed IFS of Non-Similarities</a>, arXiv:math/9806039 [math.CA], 1991.
%H <a href="/index/Fi#FIXEDPOINTS">Index entries for sequences that are fixed points of mappings</a>
%t 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 *)
%Y Cf. A105777, A105791.
%K nonn,easy,less
%O 0,2
%A _Roger L. Bagula_, May 04 2005
%E Definition corrected by _Georg Fischer_, May 14 2021