%I #5 Apr 24 2017 10:33:01
%S 0,1,0,1,1,0,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,1,0,0,1,
%T 0,1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,1,0,0,1,0,1,0,1,
%U 0,1,1,0,0,1,0,1,1,0,1,0,0,1,0,1,1,0
%N 0-limiting word of the morphism 0->10, 1-> 0101.
%C The morphism 0->10, 1-> 0101 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 10 -> 0101 -> 100101100101 -> 010110100101100101010110100101100101; if the number of iterations is odd, the 1-word evolves from 0 -> 10 -> 0101 -> 100101100101, as in A285252.
%H Clark Kimberling, <a href="/A285249/b285249.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1, 0}, 1 -> {0, 1, 0, 1}}] &, {0}, 12]; (* A285249 *)
%t Flatten[Position[s, 0]]; (* A285250 *)
%t Flatten[Position[s, 1]]; (* A285251 *)
%Y Cf. A285250, A285251, A285252.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 23 2017
|