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

%I

%S 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,

%T 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,

%U 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

%N Abelian complexity function of A064990.

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

%H Nathan Fox, <a href="/A216197/a216197.py.txt">Python program to generate sequence</a>

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

%Y Cf. A064990, A189718.

%K nonn,easy

%O 1,1

%A _Nathan Fox_, Mar 12 2013

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 August 17 22:59 EDT 2019. Contains 326059 sequences. (Running on oeis4.)