|
%I #5 Apr 21 2017 08:06:29
%S 0,0,1,0,1,0,0,0,1,0,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,1,0,1,0,0,0,
%T 1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,1,0,1,0,0,0,1,0,1,0,0,0,
%U 1,0,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0
%N 0-limiting word of the morphism 0->10, 1-> 0010.
%C The morphism 0->10, 1->0010 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 10 -> 001010 -> 1010001010001010 -> 00101000101010100010100010101010001010001010; if the number of iterations is odd, the 1-word evolves from 0 -> 10 -> 001010 -> 1010001010001010, as in A285142.
%H Clark Kimberling, <a href="/A285139/b285139.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1, 0}, 1 -> {0, 0, 1, 0}}] &, {0}, 12]; (* A285139 *)
%t Flatten[Position[s, 0]]; (* A285140 *)
%t Flatten[Position[s, 1]]; (* A285141 *)
%Y Cf. A285140, A285141, A285142.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 20 2017
|
