The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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. 10

%I #15 Jan 20 2022 10:18:02

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

%H Seiichi Manyama, <a href="/A168656/b168656.txt">Table of n, a(n) for n = 1..10000</a>

%F G.f.: Sum_{k>=1} x^(k^2)/((1-x^(k^2)) * Product_{i=1..k-1} (1-x^i)).

%o (PARI)

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

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

%Y Cf. A000041, A073336, A079501, A168655, A168657, A168659.

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 8 05:45 EDT 2024. Contains 373207 sequences. (Running on oeis4.)