A289011 - OEIS

%I #7 Apr 07 2020 22:29:02

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

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

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

%N Fixed point of the mapping 00->0010, 01->001, 10->100, starting with 00.

%C The number of letters (0's and 1's) in the n-th iterate of the mapping is given by A289010.

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

%e The first seven iterates of the mapping:

%e 00

%e 0010

%e 0010100

%e 00101001000

%e 001010010000100100

%e 0010100100001001000101000010010

%e 0010100100001001000101000010010001001001000101000010

%t z = 11; (* number of iterates *)

%t s = {0, 0}; w[0] = StringJoin[Map[ToString, s]];

%t w[n_] := StringReplace[w[n - 1], {"00" -> "0010", "01" -> "001", "10" -> "100"}]

%t TableForm[Table[w[n], {n, 0, 10}]]

%t st = ToCharacterCode[w[z]] - 48   (* A289011 *)

%t Flatten[Position[st, 0]]  (* A289012 *)

%t Flatten[Position[st, 1]]  (* A289013 *)

%t Table[StringLength[w[n]], {n, 0, 20}] (* A289000 *)

%Y Cf. A289008, A289009, A289000.

%K nonn,easy

%O 1

%A _Clark Kimberling_, Jun 26 2017