A216197 Abelian complexity function of A064990.

2, 3, 4, 3, 4, 5, 4, 5, 6, 5, 4, 5, 4, 5, 6, 5, 6, 7, 6, 5, 6, 5, 6, 7, 6, 7, 8, 7, 6, 7, 6, 5, 6, 5, 6, 7, 6, 5, 6, 5, 6, 7, 6, 7, 8, 7, 6, 7, 6, 7, 8, 7, 8, 9, 8, 7, 8, 7, 6, 7, 6, 7, 8, 7, 6, 7, 6, 7, 8, 7, 8, 9, 8, 7, 8, 7, 8, 9, 8, 9, 10, 9, 8, 9, 8, 7, 8, 7, 8, 9, 8, 7, 8, 7, 6, 7, 6, 7, 8

Offset

1,1

Comments

a(n) also equals the Abelian complexity function of A189718.

Links

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

Nathan Fox, Python program to generate sequence

Formula

a(1) = 2; a(3n) = a(n) + 2; a(3n-1) = a(n) + 1; a(3n+1) = a(n) + 1.

Crossrefs

Cf. A064990, A189718.

Sequence in context: A325933 A114524 A058033 * A374054 A307531 A125619

Adjacent sequences: A216194 A216195 A216196 * A216198 A216199 A216200

Keyword

nonn,easy

Author

Nathan Fox, Mar 12 2013

Status

approved