|
%I #6 Apr 05 2017 07:43:54
%S 0,0,0,1,0,0,0,1,0,0,0,1,1,1,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,1,1,1,
%T 0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,1,1,1,0,0,0,1,1,1,1,0,0,0,1,1,1,1,0,
%U 0,0,1,1,1,1,0,0,0,1,0,0,0,1,0,0,0,1
%N 0-limiting word of the morphism 0->1, 1->0001.
%C The morphism 0->1, 1->0001 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 1 -> 0001 -> 1110001 -> 0001000100011110001; if the number of iterations is odd, the 1-word evolves from 0 -> 1 -> 0001 -> 1110001 ->, as in A284512.
%H Clark Kimberling, <a href="/A284508/b284508.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1}, 1 -> {0, 0, 0, 1}}] &, {0}, 8] (* A284508 *)
%t Flatten[Position[s, 0]] (* A284509 *)
%t Flatten[Position[s, 1]] (* A284510 *)
%Y Cf. A284509, A284510, A284512.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 04 2017
|
