Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #5 Apr 30 2017 22:37:46
%S 1,1,0,1,1,0,0,1,1,0,1,1,1,1,0,1,1,0,0,1,1,0,1,1,0,1,1,0,0,1,1,0,1,1,
%T 0,1,1,0,0,1,1,0,1,1,1,1,0,1,1,0,0,1,1,0,1,1,0,1,1,0,0,1,1,0,0,1,1,0,
%U 0,1,1,0,1,1,0,1,1,0,0,1,1,0,1,1,1,1
%N 1-limiting word of the morphism 0->11, 1-> 0110.
%C The morphism 0->11, 1-> 0110 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 11 -> 01100110; if the number of iterations is odd, the 1-word evolves from 0 -> 11 -> 01100110 -> 110110011011110110011011, as in A285568.
%H Clark Kimberling, <a href="/A285568/b285568.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1, 1}, 1 -> {0, 1, 1, 0}}] &, {0}, 9] (* A285568 *)
%t Flatten[Position[s, 0]] (* A285569 *)
%t Flatten[Position[s, 1]] (* A286031 *)
%Y Cf. A285566, A285569, A286031.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 30 2017