|
%I #6 Apr 06 2017 21:47:08
%S 1,1,0,0,1,0,1,1,1,0,0,1,0,1,0,0,1,0,0,0,1,0,1,1,0,0,1,0,1,0,0,1,0,1,
%T 1,0,0,1,0,1,1,1,0,0,1,0,1,1,1,0,0,1,0,1,0,0,1,0,0,0,1,0,1,1,0,0,1,0,
%U 1,0,0,1,0,1,1,0,0,1,0,1,0,0,1,0,0,0
%N 1-limiting word of the morphism 0->1, 1->0010.
%C The morphism 0->1, 1-> 0010 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 1 -> 0010 -> 1100101 -> 0010001011001010010; if the number of iterations is odd, the 1-word evolves from 0 -> 1 -> 0010 -> 1100101 ->, as in A284527.
%H Clark Kimberling, <a href="/A284527/b284527.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1}, 1 -> {0, 0, 1, 0}}] &, {0}, 9] (* A284527 *)
%t Flatten[Position[s, 0]] (* A284528 *)
%t Flatten[Position[s, 1]] (* A284529 *)
%Y Cf. A284524, A284528, A284529.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 05 2017
|
