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!)
A301508 Expansion of Product_{k>=0} (1 + x^(4*k+2))*(1 + x^(4*k+3)). 3
1, 0, 1, 1, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 2, 3, 4, 4, 5, 5, 6, 7, 6, 8, 9, 9, 11, 12, 13, 14, 15, 17, 19, 20, 23, 25, 27, 29, 31, 35, 37, 40, 46, 48, 52, 57, 60, 66, 71, 76, 85, 90, 97, 105, 112, 121, 129, 140, 152, 161, 174, 187, 198, 214, 228, 245, 265, 280, 302, 323, 342 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,10
COMMENTS
Number of partitions of n into distinct parts congruent to 2 or 3 mod 4.
LINKS
FORMULA
G.f.: Product_{k>=1} (1 + x^A042964(k)).
a(n) ~ exp(Pi*sqrt(n/6)) / (4*3^(1/4)*n^(3/4)). - Vaclav Kotesovec, Mar 23 2018
EXAMPLE
a(13) = 3 because we have [11, 2], [10, 3] and [7, 6].
MATHEMATICA
nmax = 70; CoefficientList[Series[Product[(1 + x^(4 k + 2)) (1 + x^(4 k + 3)), {k, 0, nmax}], {x, 0, nmax}], x]
nmax = 70; CoefficientList[Series[QPochhammer[-x^2, x^4] QPochhammer[-x^3, x^4], {x, 0, nmax}], x]
nmax = 70; CoefficientList[Series[Product[(1 + Boole[MemberQ[{2, 3}, Mod[k, 4]]] x^k), {k, 1, nmax}], {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A327966 A366580 A088019 * A178930 A126759 A293444
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Mar 22 2018
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 August 24 18:44 EDT 2024. Contains 375417 sequences. (Running on oeis4.)