|
%I #4 Apr 18 2017 22:41:40
%S 1,0,1,0,1,0,0,0,0,1,0,1,0,1,0,1,0,0,0,0,1,0,1,0,1,0,1,0,0,0,0,1,0,0,
%T 0,0,1,0,0,0,0,1,0,0,0,0,1,0,1,0,1,0,1,0,0,0,0,1,0,1,0,1,0,1,0,0,0,0,
%U 1,0,1,0,1,0,1,0,0,0,0,1,0,1,0,1,0,1
%N 1-limiting word of the morphism 0->10, 1-> 000.
%C The morphism 0->10, 1->000 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 10 -> 00010 -> 10101000010 -> 00010000100001010101000010; if the number of iterations is odd, the 1-word evolves from 0 -> 10 -> 00010 -> 10101000010, as in A284957.
%H Clark Kimberling, <a href="/A284957/b284957.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1, 0}, 1 -> {0, 0, 0}}] &, {0}, 9]; (* A284957 *)
%t Flatten[Position[s, 0]]; (* A284958 *)
%t Flatten[Position[s, 1]]; (* A284959 *)
%Y Cf. A284954, A284958, A284959.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 18 2017
|
