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