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