A216199 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A216199

Abelian complexity function of the ternary Thue-Morse word (A036577).

1

3, 3, 5, 3, 4, 5, 4, 3, 5, 4, 6, 5, 6, 4, 5, 3, 4, 5, 6, 4, 6, 6, 6, 5, 6, 6, 6, 4, 6, 5, 4, 3, 5, 4, 6, 5, 6, 6, 6, 4, 6, 6, 8, 6, 7, 6, 6, 5, 6, 6, 7, 6, 8, 6, 6, 4, 6, 6, 6, 5, 6, 4, 5, 3, 4, 5, 6, 4, 6, 6, 6, 5, 6, 6, 7, 6, 8, 6, 6, 4, 6, 6, 8, 6, 7, 8, 7, 6, 8, 7, 8, 6, 7, 6, 6, 5, 6, 6, 7

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

OFFSET

1,1

COMMENTS

abs(a(n) - (3/2)*(A007302(n) + 1)) <= 1/2.

LINKS

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

Nathan Fox, Python code to generate sequence

CROSSREFS

Cf. A036577, A007302.

Sequence in context: A352351 A359421 A014780 * A073081 A094928 A178984

Adjacent sequences: A216196 A216197 A216198 * A216200 A216201 A216202

KEYWORD

nonn,easy

AUTHOR

Nathan Fox, Mar 12 2013

STATUS

approved