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!)
A280487 G.f.: Product_{i>=1, j>=1, k>=1, l>=1} 1/(1 - x^(i*j*k*l)). 7
1, 1, 5, 9, 29, 49, 135, 235, 565, 995, 2177, 3821, 7900, 13728, 26974, 46606, 88128, 150644, 276283, 467647, 835708, 1400874, 2448818, 4065230, 6975307, 11470265, 19359345, 31552473, 52488142, 84808548, 139274675, 223191639, 362297234, 576064732, 925295844 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
Lida Ahmadi, Ricardo Gómez Aíza, and Mark Daniel Ward, A unified treatment of families of partition functions, arXiv:2303.02240 [math.CO], 2023.
FORMULA
G.f.: Product_{k>=1} 1/(1 - x^k)^tau_4(k), where tau_4() = A007426. - Ilya Gutkovskiy, May 22 2018
MATHEMATICA
nmax=50; CoefficientList[Series[Product[1/(1-x^(i*j*k*l)), {i, 1, nmax}, {j, 1, nmax/i}, {k, 1, nmax/i/j}, {l, 1, nmax/i/j/k}], {x, 0, nmax}], x]
nmax = 50; tau4 = Table[DivisorSum[n, DivisorSigma[0, n/#] * DivisorSigma[0, #] &], {n, 1, nmax}]; s = 1 - x; Do[s *= Sum[Binomial[tau4[[k]], j]*(-1)^j*x^(j*k), {j, 0, nmax/k}]; s = Expand[s]; s = Take[s, Min[nmax + 1, Exponent[s, x] + 1, Length[s]]]; , {k, 2, nmax}]; CoefficientList[Series[1/s, {x, 0, nmax}], x] (* Vaclav Kotesovec, Sep 08 2018 *)
CROSSREFS
Sequence in context: A192914 A303676 A163779 * A191013 A193487 A006131
KEYWORD
nonn
AUTHOR
Vaclav Kotesovec, Jan 04 2017
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.)