This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) also equals the Abelian complexity function of A189718. LINKS 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: A214613 A114524 A058033 * A307531 A125619 A262519 Adjacent sequences:  A216194 A216195 A216196 * A216198 A216199 A216200 KEYWORD nonn,easy AUTHOR Nathan Fox, Mar 12 2013 STATUS approved

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.

Last modified July 17 14:39 EDT 2019. Contains 325106 sequences. (Running on oeis4.)