|
%I #15 Aug 12 2017 13:03:10
%S 1,2,1,2,3,2,1,2,1,2,3,2,3,1,3,2,3,2,1,2,1,2,3,2,1,2,1,2,3,2,3,1,3,2,
%T 3,2,3,1,3,1,2,1,3,1,3,2,3,2,3,1,3,2,3,2,1,2,1,2,3,2,1,2,1,2,3,2,3,1,
%U 3,2,3,2,1,2,1,2,3,2,1,2,1,2,3,2,3,1,3,2,3,2,3,1,3,1,2,1,3,1,3,2,3,2,3,1,3
%N Trajectory of 1 under the morphism f: 1->{1,2,1}, 2->{2,3,2}, 3->{3,1,3}.
%H Antti Karttunen, <a href="/A105203/b105203.txt">Table of n, a(n) for n = 0..19682</a>
%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 (1982), 78-104; page 96, section 4.10.
%H <a href="/index/Fi#FIXEDPOINTS">Index entries for sequences that are fixed points of mappings</a>
%F a(0) = 1; and for n > 1, a(n) = A105202(n+A003462(1+A062153(n))). - _Antti Karttunen_, Aug 12 2017
%t Nest[ Flatten[ # /. {1 -> {1, 2, 1}, 2 -> {2, 3, 2}, 3 -> {3, 1, 3}}] &, {1}, 5] (* _Robert G. Wilson v_, Apr 12 2005 *)
%o (Scheme) (define (A105203 n) (if (zero? n) 1 (A105202 (+ n (A003462 (+ 1 (A062153 n))))))) ;; _Antti Karttunen_, Aug 12 2017
%Y Cf. A003462, A062153, A073058, A105141, A105202.
%K nonn
%O 0,2
%A _Roger L. Bagula_, Apr 09 2005
%E More terms from _Robert G. Wilson v_, Apr 12 2005
|
