A285467 - OEIS

%I #4 Apr 30 2017 07:51:11

%S 1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,1,1,1,1,1,

%T 1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,1,1,1,1,1,1,1,0,0,0,1,0,0,0,1,0,0,0,1,

%U 0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,1,1

%N 1-limiting word of the morphism 0->11, 1-> 0001.

%C The morphism 0->11, 1-> 0001 has two limiting words.  If the number of iterations is even, the 0-word evolves from 0 -> 11 -> 00010001 -> 11111100011111110001 -> 00010000001... ; if the number of iterations is odd, the 1-word evolves from 0 -> 11 -> 00010001 -> 11111100011111110001, as in A285467.

%H Clark Kimberling, <a href="/A285467/b285467.txt">Table of n, a(n) for n = 1..10000</a>

%t s = Nest[Flatten[# /. {0 -> {1, 1}, 1 -> {0, 0, 0, 1}}] &, {0}, 11] (* A285467 *)

%t Flatten[Position[s, 0]]  (* A285468 *)

%t Flatten[Position[s, 1]]  (* A285469 *)

%Y Cf. A285464, A285468, A285469.

%K nonn,easy

%O 1

%A _Clark Kimberling_, Apr 29 2017