|
%I #5 Apr 20 2017 09:23:56
%S 0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,1,0,1,0,1,0,1,0,0,0,
%T 0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,1,0,1,0,1,0,
%U 1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0
%N 0-limiting word of the morphism 0->10, 1-> 0000.
%C The morphism 0->10, 1->0000 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 10 -> 000010 -> 10101010000010 -> 00001000001000001000001010101010000010; if the number of iterations is odd, the 1-word evolves from 0 -> 10 -> 000010 -> 10101010000010, as in A285128.
%H Clark Kimberling, <a href="/A285125/b285125.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1, 0}, 1 -> {0, 0, 0, 0}}] &, {0}, 14]; (* A285125 *)
%t Flatten[Position[s, 0]]; (* A285126 *)
%t Flatten[Position[s, 1]]; (* A285127 *)
%Y Cf. A285128, A285126, A285127.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 19 2017
|
