login
a(n) is formed by concatenating the first n terms of A219749.
1

%I #6 Jul 06 2018 23:15:18

%S 11212112,1121211211121121112,112121121112112111211112111211112,

%T 11212112111211211121111211121111211111211112111112,

%U 1121211211121121112111121112111121111121111211111211111121111121111112,112121121112112111211112111211112111112111121111121111112111112111111211111112111111211111112

%N a(n) is formed by concatenating the first n terms of A219749.

%H J. Berstel, A. Lauve, C. Reutenauer & F. Saliola, <a href="http://www-igm.univ-mlv.fr/~berstel/LivreCombinatoireDesMots/2008wordsbookMtlUltimate.pdf">Combinatorics on Words: Christoffel Words and Repetitions in Words</a>, 2008; see p. 110.

%H Aviezri S. Fraenkel and Jamie Simpson, <a href="https://dx.doi.org/10.1006/jcta.1997.2843">How Many Squares Can a String Contain?</a>, Journal of Combinatorial Theory, Series A 82, 112-120 (1998).

%Y Cf. A219749.

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Nov 28 2012