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!)
A301570 Expansion of Product_{k>=1} (1 + x^(5*k))*(1 + x^(5*k-1)). 7
1, 0, 0, 0, 1, 1, 0, 0, 0, 2, 1, 0, 0, 1, 3, 2, 0, 0, 2, 5, 2, 0, 0, 4, 7, 3, 0, 1, 7, 10, 4, 0, 2, 11, 14, 5, 0, 4, 17, 19, 6, 0, 8, 25, 25, 8, 1, 13, 36, 33, 10, 2, 21, 50, 43, 12, 4, 33, 69, 55, 15, 8, 49, 93, 70, 18, 14, 71, 124, 88, 23, 23, 102, 163, 110, 29, 37 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,10
COMMENTS
Number of partitions of n into distinct parts congruent to 0 or 4 mod 5.
LINKS
FORMULA
G.f.: Product_{k>=2} (1 + x^A047208(k)).
a(n) ~ exp(Pi*sqrt(2*n/15)) / (2^(41/20) * 15^(1/4) * n^(3/4)). - Vaclav Kotesovec, Mar 24 2018
EXAMPLE
a(14) = 3 because we have [14], [10, 4] and [9, 5].
MATHEMATICA
nmax = 76; CoefficientList[Series[Product[(1 + x^(5 k)) (1 + x^(5 k - 1)), {k, 1, nmax}], {x, 0, nmax}], x]
nmax = 76; CoefficientList[Series[x QPochhammer[-1, x^5] QPochhammer[-x^(-1), x^5]/(2 (1 + x)), {x, 0, nmax}], x]
nmax = 76; CoefficientList[Series[Product[(1 + Boole[MemberQ[{0, 4}, Mod[k, 5]]] x^k), {k, 1, nmax}], {x, 0, nmax}], x]
CROSSREFS
Sequence in context: A071676 A319933 A335964 * A301567 A115363 A327191
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 April 16 14:51 EDT 2024. Contains 371749 sequences. (Running on oeis4.)