|
%I #5 Apr 27 2017 22:50:29
%S 1,1,1,1,0,0,1,1,1,1,1,0,0,1,1,1,1,1,0,0,1,1,1,1,1,0,0,1,0,0,1,0,0,1,
%T 0,0,1,0,0,1,1,1,1,1,0,0,1,1,1,1,1,0,0,1,1,1,1,1,0,0,1,1,1,1,1,0,0,1,
%U 1,1,1,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0
%N 1-limiting word of the morphism 0->11, 1-> 001.
%C The morphism 0->11, 1-> 001 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 11 -> 001001 -> 11110011111001 ->
%C 00100100100111110010010010010011111001; if the number of iterations is odd, the 1-word evolves from 0 -> 11 -> 001001 -> 11110011111001 , as in A285403.
%H Clark Kimberling, <a href="/A285403/b285403.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1, 1}, 1 -> {0, 0, 1}}] &, {0}, 11] (* A285403 *)
%t Flatten[Position[s, 0]] (* A285404 *)
%t Flatten[Position[s, 1]] (* A285405 *)
%Y Cf. A285401, A285404, A285405.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 27 2017
|
