|
%I #5 Apr 25 2017 09:59:22
%S 0,1,1,1,1,0,1,0,0,1,1,1,0,1,1,1,0,1,1,1,1,0,0,1,1,1,0,1,1,1,0,1,1,1,
%T 1,0,0,1,1,1,0,1,1,1,0,1,1,1,1,0,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,
%U 1,0,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1
%N 0-limiting word of the morphism 0->10, 1-> 0111.
%C The morphism 0->10, 1-> 0111 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 10 -> 011110 -> 10011101110111011110 ->
%C 01111010011101110111100111011101111001110111011110011101110111011110; if the number of iterations is odd, the 1-word evolves from 0 -> 10 -> 011110 -> 10011101110111011110, as in A285277.
%H Clark Kimberling, <a href="/A285274/b285274.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1, 0}, 1 -> {0, 1, 1, 1}}] &, {0}, 10]; (* A285274 *)
%t Flatten[Position[s, 0]]; (* A285275 *)
%t Flatten[Position[s, 1]]; (* A285276 *)
%Y Cf. A285275, A285276, A285277.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 24 2017
|
