A245189 - OEIS

The OEIS is supported by the many generous donors to the OEIS 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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A245189

Abelian complexity of the 3-block coding of the period-doubling word A096268.

1, 5, 5, 8, 6, 10, 9, 11, 6, 12, 10, 14, 11, 14, 10, 12, 6, 12, 10, 15, 11, 17, 14, 18, 11, 18, 14, 17, 11, 15, 10, 12, 6, 12, 10, 15, 11, 17, 14, 18, 11, 19, 15, 21, 16, 21, 15, 19, 11, 19, 15, 21, 16, 21, 15, 19, 11, 18, 14, 17, 11, 15, 10, 12, 6, 12, 10, 15, 11, 17, 14, 18, 11, 19, 15, 21, 16, 21, 15, 19, 11, 19, 15, 22, 16, 24, 19, 25, 16, 25, 19, 24, 16, 22, 15, 19, 11, 19, 15, 22

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

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. See "Conclusions" section.

CROSSREFS

Cf. A096268.

Sequence in context: A021183 A193424 A141864 * A217169 A141538 A358257

Adjacent sequences: A245186 A245187 A245188 * A245190 A245191 A245192

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jul 21 2014

EXTENSIONS

Definition corrected by Eric Rowland, Oct 02 2016

a(6) corrected by and more terms from Eric Rowland, Oct 02 2016

STATUS

approved