|
%I #7 Feb 22 2024 20:17:22
%S 0,1,0,0,1,0,1,0,0,1,0,0,1,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,1,0,0,1,0,0,
%T 1,0,1,0,0,1,0,0,1,0,1,0,0,1,0,0,1,0,1,0,0,1,0,0,1,0,0,1,0,0,1,0,1,0,
%U 0,1,0,0,1,0,1,0,0,1,0,0,1,0,0,1,0,0
%N 0-limiting word of the morphism 0->10, 1-> 0100.
%C The morphism 0->10, 1-> 0100 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 10 -> 0100 -> 1001001010 -> 0100101001001010010010010010; if the number of iterations is odd, the 1-word evolves from 0 -> 10 -> 0100 -> 1001001010, as in A285208.
%H Clark Kimberling, <a href="/A285205/b285205.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1, 0}, 1 -> {0, 1, 0, 0}}] &, {0}, 12]; (* A285205 *)
%t Flatten[Position[s, 0]]; (* A285206 *)
%t Flatten[Position[s, 1]]; (* A285207 *)
%Y Cf. A285206, A285207, A285208.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 21 2017
|
