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