|
%I
%S 0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,1,0,1,0,1,0,0,0,0,1,1,0,1,0,1,0,
%T 0,0,0,1,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,0,1,1,0,1,0,1,0,1,0,
%U 0,0,0,1,1,0,1,0,1,0,0,0,0,1,0,0,0,1
%N 0-limiting word of the morphism 0->10, 1-> 0001.
%C The morphism 0->10, 1->0001 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 10 -> 000110 -> 1010100001000110 -> 00011000011000011010101000011010100001000110; if the number of iterations is odd, the 1-word evolves from 0 -> 10 -> 000110 -> 1010100001000110, as in A285136.
%H Clark Kimberling, <a href="/A285133/b285133.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1, 0}, 1 -> {0, 0, 0, 1}}] &, {0}, 12]; (* A285133 *)
%t Flatten[Position[s, 0]]; (* A285134 *)
%t Flatten[Position[s, 1]]; (* A285135 *)
%Y Cf. A285134, A285135, A285136.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 20 2017
|
