A245186 2-abelian complexity of the Thue-Morse word (A010060).

1, 2, 4, 6, 8, 6, 8, 10, 8, 6, 8, 8, 10, 10, 10, 8, 8, 6, 8, 10, 10, 8, 10, 12, 12, 10, 12, 12, 10, 8, 10, 10, 8, 6, 8, 8, 10, 10, 12, 12, 10, 8, 10, 12, 14, 12, 12, 12, 12, 10, 12, 12, 12, 12, 14, 12, 10, 8, 10, 12, 12, 10, 10, 8, 8, 6, 8, 10, 10, 8, 10, 12, 12, 10, 12, 12, 12, 12, 14, 12, 10, 8, 10, 12, 14, 12, 14, 16, 14, 12, 14, 14, 14, 12, 12, 12, 12, 10, 12, 12

Offset

0,2

Comments

This sequence is 2-regular. - Eric Rowland, Oct 02 2016

Links

Table of n, a(n) for n=0..99.

A. Parreau, M. Rigo, E. Rowland, E. Vandomme, A new approach to the 2-regularity of the l-abelian complexity of 2-automatic sequences, arXiv preprint arXiv:1405.3532, 2014.

Crossrefs

Cf. A010060.

Sequence in context: A326352 A299479 A185361 * A230865 A178699 A355311

Adjacent sequences: A245183 A245184 A245185 * A245187 A245188 A245189

Keyword

nonn

Author

N. J. A. Sloane, Jul 20 2014

Extensions

More terms from Eric Rowland, Oct 02 2016

Status

approved