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!)
A219607 Number of partitions of n into distinct parts 5*k+2 or 5*k+3. 14

%I #20 Mar 20 2017 07:45:36

%S 1,0,1,1,0,1,0,1,1,1,2,1,2,2,1,3,1,3,3,2,5,3,5,5,4,7,4,7,7,6,11,7,11,

%T 11,9,15,10,15,16,14,22,16,23,23,20,30,22,31,32,29,42,33,44,45,41,56,

%U 45,59,61,57,78,64,82,84,78,103,86,108,112,107,138

%N Number of partitions of n into distinct parts 5*k+2 or 5*k+3.

%C Convolution of A281271 and A281272. - _Vaclav Kotesovec_, Jan 18 2017

%H Seiichi Manyama, <a href="/A219607/b219607.txt">Table of n, a(n) for n = 0..1000</a> (terms 0..250 from Reinhard Zumkeller)

%F a(n) ~ exp(sqrt(2*n/15)*Pi) / (2*30^(1/4)*n^(3/4)) * (1 - (3*sqrt(15/2)/(8*Pi) + 11*Pi/(60*sqrt(30))) / sqrt(n)). - _Vaclav Kotesovec_, Jan 18 2017, extended Jan 24 2017

%e a(10) = #{8+2, 7+3} = 2;

%e a(11) = #{8+3} = 1;

%e a(12) = #{12, 7+3+2} = 2;

%e a(13) = #{13, 8+3+2} = 2;

%e a(14) = #{12+2} = 1;

%e a(15) = #{13+2, 12+3, 8+7} = 3;

%e a(16) = #{13+3} = 1;

%e a(17) = #{17, 12+3+2, 8+7+2} = 3;

%e a(18) = #{18, 13+3+2, 8+7+3} = 3;

%e a(19) = #{17+2, 12+7} = 2;

%e a(20) = #{18+2, 17+3, 13+7, 12+8, 8+7+3+2} = 5.

%t nmax = 100; CoefficientList[Series[Product[(1 + x^(5*k - 2))*(1 + x^(5*k - 3)), {k, 1, nmax}], {x, 0, nmax}], x] (* _Vaclav Kotesovec_, Jan 18 2017 *)

%o (Haskell)

%o a219607 = p a047221_list where

%o p _ 0 = 1

%o p (k:ks) m = if m < k then 0 else p ks (m - k) + p ks m

%Y Cf. A047221, A003106, A203776.

%K nonn

%O 0,11

%A _Reinhard Zumkeller_, Nov 30 2012

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 April 16 18:22 EDT 2024. Contains 371750 sequences. (Running on oeis4.)