|
%I #5 Apr 18 2017 22:41:16
%S 0,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,0,0,0,1,0,0,0,0,
%T 1,0,0,0,0,1,0,1,0,1,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,1,
%U 0,1,0,1,0,0,0,0,1,0,1,0,1,0,1,0,0,0
%N 0-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="/A284954/b284954.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1, 0}, 1 -> {0, 0, 0}}] &, {0}, 8]; (* A284954 *)
%t Flatten[Position[s, 0]]; (* A284955 *)
%t Flatten[Position[s, 1]]; (* A284956 *)
%Y Cf. A284955, A284956, A284957.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 18 2017
|
