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!)
A301568 Expansion of Product_{k>=1} (1 + x^(5*k))*(1 + x^(5*k-3)). 7
1, 0, 1, 0, 0, 1, 0, 2, 0, 1, 1, 0, 3, 0, 2, 2, 0, 5, 0, 4, 2, 1, 7, 0, 7, 3, 2, 10, 0, 11, 4, 4, 14, 0, 17, 5, 8, 19, 1, 25, 6, 13, 25, 2, 36, 8, 21, 33, 4, 50, 10, 33, 43, 8, 69, 12, 49, 55, 14, 93, 16, 71, 70, 23, 124, 20, 102, 88, 37, 163, 26, 142, 110, 57, 212 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
COMMENTS
Number of partitions of n into distinct parts congruent to 0 or 2 mod 5.
LINKS
FORMULA
G.f.: Product_{k>=1} (1 + x^A047215(k)).
a(n) ~ exp(Pi*sqrt(2*n/15)) / (2^(33/20) * 15^(1/4) * n^(3/4)). - Vaclav Kotesovec, Mar 24 2018
EXAMPLE
a(12) = 3 because we have [12], [10, 2] and [7, 5].
MATHEMATICA
nmax = 74; CoefficientList[Series[Product[(1 + x^(5 k)) (1 + x^(5 k - 3)), {k, 1, nmax}], {x, 0, nmax}], x]
nmax = 74; CoefficientList[Series[x^3 QPochhammer[-1, x^5] QPochhammer[-x^(-3), x^5]/(2 (1 + x) (1 - x + x^2)), {x, 0, nmax}], x]
nmax = 74; CoefficientList[Series[Product[(1 + Boole[MemberQ[{0, 2}, Mod[k, 5]]] x^k), {k, 1, nmax}], {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A337048 A318051 A301569 * A036851 A036850 A260492
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Mar 23 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 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)