This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A168656 Number of partitions of n such that the smallest part is divisible by the number of parts. 4

%I

%S 1,1,1,2,2,2,2,3,4,4,5,6,7,7,8,10,11,13,15,18,20,23,25,29,33,36,41,47,

%T 53,58,66,74,83,92,103,116,130,144,160,179,199,219,243,269,298,328,

%U 362,399,441,484,533,586,645,708,778,854,937,1026,1124,1230,1347,1470,1607,1756,1917,2089

%N Number of partitions of n such that the smallest part is divisible by the number of parts.

%F G.f.: Sum(x^(k^2)/(1-x^(k^2))/Product(1-x^i,i=1..k-1),k=1..infinity).

%o (PARI)

%o N=100; x='x+O('x^N);

%o Vec( sum(k=1,N, x^(k^2)/(1-x^(k^2)) / prod(i=1,k-1, 1-x^i) ) )

%Y Cf. A079501, A168655.

%K easy,nonn

%O 1,4

%A _Vladeta Jovovic_, Dec 01 2009, Dec 04 2009

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 21 21:14 EDT 2019. Contains 325199 sequences. (Running on oeis4.)