OFFSET
1
COMMENTS
Iterates of the mapping, starting with 00:
00
1000
011000
01011000
0011011000
10001011011000
011000011011011000
0101100001011011011000
00110110000011011011011000
1000101101100010001011011011011000
The 2-limiting word is the limit of the n-th iterates for n == 2 mod 4. Conjecture: the number of letters (0's and 1's) in the n-th iterate is given by A288732(n), for n >= 0.
LINKS
Clark Kimberling, Table of n, a(n) for n = 1..10000
EXAMPLE
The first three n-th iterates for n == 2 mod 3 are
011000
011000011011011000
011000011011011000011000011011011011011000
MATHEMATICA
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jun 16 2017
STATUS
approved