OFFSET
0
COMMENTS
The sequence is "transitive, not asymptotically periodic, has linear complexity but contains a subword with an infinite index". [Mignosi, Prop. 3.4)
LINKS
Filippo Mignosi, Infinite words with linear subword complexity, Theoretical Computer Science, Volume 65, Issue 2, 28 June 1989, Pages 221-242; doi:10.1016/0304-3975(89)90046-7.
EXAMPLE
Let f(k) denote a string of 4^k 1's. The sequence is 0, f(1), 0, f(2), 0, f(1), 0, f(3), ...
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Sep 11 2016
STATUS
approved