|
%I #12 Sep 13 2016 03:09:07
%S 0,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,0,1,1,1,1,1,1,
%T 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%U 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,0,1,1
%N Limit S_oo where S_0 = 0, S_i = S_{i-1} 1^(4^i) S_{i-1} for i >0.
%C The sequence is "transitive, not asymptotically periodic, has linear complexity but contains a subword with an infinite index". [Mignosi, Prop. 3.4)
%H Filippo Mignosi, <a href="http://dx.doi.org/10.1016/0304-3975(89)90046-7">Infinite words with linear subword complexity</a>, Theoretical Computer Science, Volume 65, Issue 2, 28 June 1989, Pages 221-242; doi:10.1016/0304-3975(89)90046-7.
%e 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), ...
%K nonn
%O 0
%A _N. J. A. Sloane_, Sep 11 2016
|
