|
%I #9 Apr 08 2017 09:46:11
%S 0,1,1,0,1,0,1,1,0,0,1,1,0,1,1,0,1,1,0,0,1,1,0,1,0,1,1,0,1,0,1,1,0,0,
%T 1,1,0,1,0,1,1,0,1,0,1,1,0,0,1,1,0,1,1,0,1,1,0,0,1,1,0,1,0,1,1,0,0,1,
%U 1,0,1,0,1,1,0,0,1,1,0,1,1,0,1,1,0,0
%N 0-limiting word of the morphism 0 -> 1, 1 -> 0110.
%C The morphism 0 -> 1, 1 -> 0110 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 1 -> 0110 -> 1011001101 -> 0110101100110110110011010110; if the number of iterations is odd, the 1-word evolves from 0 -> 1 -> 0110 -> 1011001101, as in A284656.
%H Clark Kimberling, <a href="/A284653/b284653.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1}, 1 -> {0, 1, 1, 0}}] &, {0}, 6] (* A284653 *)
%t Flatten[Position[s, 0]] (* A284654 *)
%t Flatten[Position[s, 1]] (* A284655 *)
%Y Cf. A284654, A284655, A284656.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 07 2017
|
