|
%I #6 Apr 06 2022 12:19:29
%S 1,0,1,0,0,0,1,0,0,1,1,0,1,0,1,0,0,0,1,0,0,1,1,0,0,0,1,1,0,0,0,1,1,0,
%T 1,0,1,0,0,0,1,0,0,1,1,0,0,0,1,1,0,1,0,1,0,0,0,1,1,0,1,0,0,0,1,0,0,1,
%U 1,0,1,0,1,0,0,0,1,0,0,1,1,0,1,0,1,0
%N 1-limiting word of the morphism 0->10, 1-> 001.
%C The morphism 0->10, 1->001 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 10 -> 00110 -> 101000100110 -> 00110001101010001101000100110; if the number of iterations is odd, the 1-word evolves from 0 -> 10 -> 00110 -> 101000100110, as in A285034.
%H Clark Kimberling, <a href="/A285034/b285034.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1, 0}, 1 -> {0, 0, 1}}] &, {0}, 9]; (* A285034 *)
%t Flatten[Position[s, 0]]; (* A285035 *)
%t Flatten[Position[s, 1]]; (* A285036 *)
%t SubstitutionSystem[{0->{1,0},1->{0,0,1}},{1,0},{6}][[1]] (* _Harvey P. Dale_, Apr 06 2022 *)
%Y Cf. A285032, A285035, A285036.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 19 2017
|
