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!)
A035366 Number of partitions of n into parts 4k+2 or 4k+3. 1

%I #8 Aug 27 2015 05:52:12

%S 0,1,1,1,1,3,2,3,4,5,5,8,8,11,12,15,17,22,23,30,34,40,45,56,61,73,83,

%T 98,109,130,144,169,190,219,246,286,317,365,410,467,521,597,663,754,

%U 841,950,1058,1196,1326,1494,1661,1861,2064,2315,2561,2862,3169,3531

%N Number of partitions of n into parts 4k+2 or 4k+3.

%F a(n) ~ exp(Pi*sqrt(n/3)) * Gamma(3/4) / (4 * 3^(3/8) * (2*Pi)^(1/4) * n^(7/8)). - _Vaclav Kotesovec_, Aug 27 2015

%t nmax = 100; Rest[CoefficientList[Series[Product[1/((1 - x^(4k+2))*(1 - x^(4k+3))), {k, 0, nmax}], {x, 0, nmax}], x]] (* _Vaclav Kotesovec_, Aug 27 2015 *)

%K nonn

%O 1,6

%A _Olivier GĂ©rard_

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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)