%I #5 Apr 27 2017 22:51:01

%S 0,1,0,0,1,0,1,1,0,1,0,1,1,0,1,0,0,1,0,0,1,0,0,1,0,1,1,0,1,0,1,1,0,1,

%T 0,0,1,0,1,1,0,1,0,1,1,1,1,0,1,0,1,1,0,1,0,0,1,0,1,1,0,1,0,1,1,0,1,0,

%U 0,1,0,1,1,0,1,0,1,1,1,1,0,1,0,1,1,0

%N 0-limiting word of the morphism 0->11, 1-> 010.

%C The morphism 0->11, 1-> 010 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 11 -> 010010 -> 11010111101011 -> 01001011010110100100100101101011010010; if the number of iterations is odd, the 1-word evolves from 0 -> 11 -> 010010 -> 11010111101011 , as in A285414.

%H Clark Kimberling, <a href="/A285411/b285411.txt">Table of n, a(n) for n = 1..10000</a>

%t s = Nest[Flatten[# /. {0 -> {1, 1}, 1 -> {0, 1, 0}}] &, {0}, 10] (* A285411 *)

%t Flatten[Position[s, 0]] (* A285412 *)

%t Flatten[Position[s, 1]] (* A285413 *)

%Y Cf. A285412, A285413, A285414.

%K nonn,easy

%O 1

%A _Clark Kimberling_, Apr 27 2017