|
%I #14 Apr 07 2020 21:00:54
%S 1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,
%T 1,0,0,0,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,1,
%U 0,0,0,1,0,0,0,0,0,0,1,0,0,0,1,0,0,0
%N 1-limiting word of the mapping 00->1000, 10->000, starting with 00.
%C Iterates of the mapping, starting with 00:
%C 00
%C 1000
%C 0001000
%C 100000001000
%C 0001000100010000001000
%C 10000000100000010000001000100000001000
%C The 1-limiting word is the limit of the n-th iterates for odd n.
%C Conjecture: the number of letters (0's and 1's) in the n-th iterate is given by A287439(n), for n >= 0.
%C See comments of A287372 for a proof of this conjecture. - _Michel Dekking_, Mar 19 2018
%H Clark Kimberling, <a href="/A287457/b287457.txt">Table of n, a(n) for n = 1..10000</a>
%e The first three n-th iterates for odd n:
%e 1000
%e 100000001000
%e 10000000100000010000001000100000001000
%t s = {0, 0}; w[0] = StringJoin[Map[ToString, s]];
%t w[n_] := StringReplace[w[n - 1], {"00" -> "1000", "10" -> "000"}]
%t Table[w[n], {n, 0, 8}]
%t st = ToCharacterCode[w[23]] - 48 (* A287457 *)
%t Flatten[Position[st, 0]] (* A287519 *)
%t Flatten[Position[st, 1]] (* A287186 *)
%t Table[StringLength[w[n]], {n, 0, 30}] (* A287439 *)
%Y Cf. A287372 (0-limiting word), A287519, A287186, A287439.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Jun 17 2017
|
