%I #7 Apr 08 2017 12:57:41
%S 0,1,0,1,1,0,1,0,1,1,0,1,0,1,0,1,0,1,1,0,1,0,1,1,0,1,0,1,1,0,1,0,1,1,
%T 0,1,0,1,0,1,0,1,1,0,1,0,1,1,0,1,0,1,0,1,0,1,1,0,1,0,1,1,0,1,0,1,1,0,
%U 1,0,1,1,0,1,0,1,0,1,0,1,1,0,1,0,1,1
%N 0-limiting word of the morphism 0->1, 1->0101.
%C The morphism 0->1, 1-> 0101 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 1 -> 0101 -> 1010110101 -> 0101101011010101011010110101; if the number of iterations is odd, the 1-word evolves from 0 -> 1 -> 0101 -> 1010110101, as in A284588.
%H Clark Kimberling, <a href="/A284533/b284533.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1}, 1 -> {0, 1, 0, 1}}] &, {0}, 6] (* A284533 *)
%t Flatten[Position[s, 0]] (* A284534 *)
%t Flatten[Position[s, 1]] (* A284535 *)
%Y Cf. A284534, A284535, A284588.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 07 2017
|