|
%I #7 Apr 06 2020 20:22:26
%S 0,1,0,1,0,1,0,0,1,0,1,0,0,1,0,0,1,0,1,0,0,1,0,0,1,0,1,0,1,0,0,0,1,0,
%T 0,0,1,0,0,1,0,1,0,0,1,0,0,1,0,1,0,1,0,0,0,1,0,0,0,1,0,0,1,0,1,0,1,0,
%U 0,0,1,0,0,0,1,0,0,1,0,1,0,0,1,0,0,1
%N Fixed point of the mapping 00->0101, 1->010, starting with 00.
%C Conjecture: the number of letters (0's and 1's) in the n-th iterate is given by A288260(n).
%H Clark Kimberling, <a href="/A288466/b288466.txt">Table of n, a(n) for n = 1..10000</a>
%e Iterates, starting with 00:
%e 00
%e 0101
%e 00100010
%e 0101010010100100
%e 0010001000100101010001001010100101
%t s = {0, 0}; w[0] = StringJoin[Map[ToString, s]];
%t w[n_] := StringReplace[w[n - 1], {"00" -> "0101", "1" -> "010"}]
%t Table[w[n], {n, 0, 8}]
%t st = ToCharacterCode[w[11]] - 48 (* A288466 *)
%t Flatten[Position[st, 0]] (* A288467 *)
%t Flatten[Position[st, 1]] (* A288468 *)
%t Table[StringLength[w[n]], {n, 1, 35}] (* A288260 conjectured *)
%Y Cf. A288467, A288468, A288260.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Jun 11 2017
|
