login
A216197
Abelian complexity function of A064990.
1
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.
FORMULA
a(1) = 2; a(3n) = a(n) + 2; a(3n-1) = a(n) + 1; a(3n+1) = a(n) + 1.
CROSSREFS
Sequence in context: A325933 A114524 A058033 * A374054 A307531 A125619
KEYWORD
nonn,easy
AUTHOR
Nathan Fox, Mar 12 2013
STATUS
approved