login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035366 Number of partitions of n into parts 4k+2 or 4k+3. 1
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, 98, 109, 130, 144, 169, 190, 219, 246, 286, 317, 365, 410, 467, 521, 597, 663, 754, 841, 950, 1058, 1196, 1326, 1494, 1661, 1861, 2064, 2315, 2561, 2862, 3169, 3531 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

Table of n, a(n) for n=1..58.

FORMULA

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

MATHEMATICA

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 *)

CROSSREFS

Sequence in context: A161985 A292787 A335944 * A114751 A211947 A220071

Adjacent sequences: A035363 A035364 A035365 * A035367 A035368 A035369

KEYWORD

nonn

AUTHOR

Olivier Gérard

STATUS

approved

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 December 4 23:46 EST 2022. Contains 358572 sequences. (Running on oeis4.)