login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A289112
Fixed point of the mapping 00->0010, 01->011, 10->001, starting with 00.
4
0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1
OFFSET
1
COMMENTS
Conjecture: the number of letters (0's and 1's) in the n-th iterate of the mapping is given by A289115.
LINKS
EXAMPLE
The first six iterates of the mapping:
00
0010
0010001
001000100101
00100010010001011011
00100010010001011001001101100111
MATHEMATICA
z = 11; (* number of iterates *)
s = {0, 0}; w[0] = StringJoin[Map[ToString, s]];
w[n_] := StringReplace[w[n - 1], {"00" -> "0010", "01" -> "011", "10" -> "001"}]
TableForm[Table[w[n], {n, 0, 10}]]
st = ToCharacterCode[w[z]] - 48 (* A289112 *)
Flatten[Position[st, 0]] (* A289113 *)
Flatten[Position[st, 1]] (* A289114 *)
Table[StringLength[w[n]], {n, 0, 20}] (* A289115 conjectured *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jun 28 2017
STATUS
approved