The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A245186 2-abelian complexity of the Thue-Morse word (A010060). 0


%S 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,

%T 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,

%U 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

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

%C This sequence is 2-regular. - _Eric Rowland_, Oct 02 2016

%H A. Parreau, M. Rigo, E. Rowland, E. Vandomme, <a href="http://arxiv.org/abs/1405.3532">A new approach to the 2-regularity of the l-abelian complexity of 2-automatic sequences</a>, arXiv preprint arXiv:1405.3532, 2014.

%Y Cf. A010060.

%K nonn

%O 0,2

%A _N. J. A. Sloane_, Jul 20 2014

%E More terms from _Eric Rowland_, Oct 02 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 17:41 EST 2021. Contains 349445 sequences. (Running on oeis4.)