|
%I #4 May 25 2017 09:36:05
%S 2,1,2,1,1,1,0,2,1,2,1,2,1,1,1,0,2,1,1,1,0,2,1,1,1,0,2,1,0,2,1,0,2,1,
%T 2,1,2,1,1,1,0,2,1,2,1,2,1,1,1,0,2,1,2,1,2,1,1,1,0,2,1,1,1,0,2,1,1,1,
%U 0,2,1,0,2,1,0,2,1,2,1,2,1,1,1,0,2,1
%N 2-limiting word of the morphism 0->11, 1->21, 2->0.
%C Starting with 0, the first 5 iterations of the morphism yield words shown here:
%C 1st: 11
%C 2nd: 2121
%C 3rd: 021021
%C 4th: 1102111021
%C 5th: 212111021212111021
%C The 2-limiting word is the limit of the words for which the number of iterations congruent to 2 mod 3.
%C Let U, V, W be the limits of u(n)/n, v(n)/n, w(n)/n, respectively. Then 1/U + 1/V + 1/W = 1, where
%C U = 5.5707505637226408833903376944272134...,
%C V = 1.9375648970813894129869852971548390...,
%C W = 3.2853752818613204416951688472136067...
%C If n >=2, then u(n) - u(n-1) is in {3,5,9}, v(n) - v(n-1) is in {1,2,3}, and w(n) - w(n-1) is in {2,3,5}.
%H Clark Kimberling, <a href="/A287368/b287368.txt">Table of n, a(n) for n = 1..10000</a>
%e 2nd iterate: 2121
%e 5th iterate: 212111021212111021
%t s = Nest[Flatten[# /. {0 -> {1, 1}, 1 -> {2, 1}, 2 -> 0}] &, {0}, 14] (* A287368 *)
%t Flatten[Position[s, 0]] (* A287369 *)
%t Flatten[Position[s, 1]] (* A287370 *)
%t Flatten[Position[s, 2]] (* A287371 *)
%Y Cf. A287360 (0-limiting word), A287364 (1-limiting word), A287369, A287370, A287371.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, May 24 2017
|
