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!)
A301504 Expansion of Product_{k>=1} (1 + x^(4*k))*(1 + x^(4*k-3)). 3
1, 1, 0, 0, 1, 2, 1, 0, 1, 3, 2, 0, 2, 5, 4, 1, 2, 7, 7, 2, 3, 10, 11, 4, 4, 14, 17, 8, 6, 19, 25, 13, 8, 25, 36, 21, 12, 33, 50, 33, 18, 43, 69, 49, 26, 56, 93, 71, 38, 72, 124, 102, 55, 92, 163, 142, 79, 118, 212, 195, 112, 151, 273, 265, 157, 193, 350, 354, 217, 246, 444 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
Number of partitions of n into distinct parts congruent to 0 or 1 mod 4.
LINKS
FORMULA
G.f.: Product_{k>=1} (1 + x^A042948(k)).
a(n) ~ exp(Pi*sqrt(n/6)) / (4*3^(1/4)*n^(3/4)). - Vaclav Kotesovec, Mar 23 2018
EXAMPLE
a(9) = 3 because we have [9], [8, 1] and [5, 4].
MATHEMATICA
nmax = 70; CoefficientList[Series[Product[(1 + x^(4 k)) (1 + x^(4 k - 3)), {k, 1, nmax}], {x, 0, nmax}], x]
nmax = 70; CoefficientList[Series[x^3 QPochhammer[-1, x^4] QPochhammer[-x^(-3), x^4]/(2 (1 + x) (1 - x + x^2)), {x, 0, nmax}], x]
nmax = 70; CoefficientList[Series[Product[(1 + Boole[MemberQ[{0, 1}, Mod[k, 4]]] x^k), {k, 1, nmax}], {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A330235 A048983 A301505 * A307432 A256140 A321391
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 March 28 10:31 EDT 2024. Contains 371240 sequences. (Running on oeis4.)