A023871 Expansion of Product_{k>=1} (1 - x^k)^(-k^2).

1, 1, 5, 14, 40, 101, 266, 649, 1593, 3765, 8813, 20168, 45649, 101591, 223654, 486046, 1045541, 2225167, 4692421, 9804734, 20318249, 41766843, 85218989, 172628766, 347338117, 694330731, 1379437080, 2724353422, 5350185097, 10449901555, 20304465729, 39254599832

Offset: 0

Author

Olivier Gérard

Keywords

• nonn
• easy

Comments

In general, if g.f. = Product_{k>=1} 1/(1 - x^k)^(c2*k^2 + c1*k + c0) and c2 > 0, then a(n) ~ exp(4*Pi * c2^(1/4) * n^(3/4) / (3*15^(1/4)) + c1*Zeta(3) / Pi^2 * sqrt(15*n/c2) + (Pi * 5^(1/4) * c0 / (2*3^(3/4) * c2^(1/4)) - 15^(5/4) * c1^2 * Zeta(3)^2 / (2*c2^(5/4) * Pi^5)) * n^(1/4) + c1/12 + 75 * c1^3 * Zeta(3)^3 / (c2^2 * Pi^8) - 5*c0 * c1 * Zeta(3) / (4*c2 * Pi^2) - c2*Zeta(3) / (4*Pi^2)) * Pi^(c1/12) * (c2/15)^(1/8 + c0/8 + c1/48) / (A^c1 * 2^((c0 + 3)/2) * n^(5/8 + c0/8 + c1/48)), where A is the Glaisher-Kinkelin constant A074962. - Vaclav Kotesovec, Nov 08 2017

Let A(x) = Product_{k >= 1} (1 - x^k)^(-k^2). The sequence defined by u(n) := [x^n] A(x)^n is conjectured to satisfy the supercongruences u(n*p^r) == u(n*p^(r-1)) (mod p^(3*r)) for all primes p >= 7 and all positive integers n and r. See A380290. - Peter Bala, Feb 02 2025

a(n) is the number of partitions of n where there are k^2 sorts of part k. - Joerg Arndt, Feb 02 2025

Links

• Seiichi Manyama, Table of n, a(n) for n = 0..10000 (first 1001 terms from Alois P. Heinz)
• G. Almkvist, Asymptotic formulas and generalized Dedekind sums, Exper. Math., 7 (No. 4, 1998), pp. 343-359.
• Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 21.

Crossrefs

Euler transform of squares (A000290).

Cf. A000219, A023872-A023878, A294530, A380290.

Column k=2 of A144048. - Alois P. Heinz, Nov 02 2012

Programs

Magma

m:=40; R:=PowerSeriesRing(Rationals(), m); Coefficients(R! ( (&*[1/(1-x^k)^k^2: k in [1..m]]) )); // G. C. Greubel, Oct 29 2018

Maple

with(numtheory):
a:= proc(n) option remember; `if`(n=0, 1,
      add(add(d*d^2, d=divisors(j)) *a(n-j), j=1..n)/n)
    end:
seq(a(n), n=0..35); # Alois P. Heinz, Nov 02 2012

Mathematica

max = 31; Series[ Product[ 1/(1-x^k)^k^2, {k, 1, max}], {x, 0, max}] // CoefficientList[#, x]& (* Jean-François Alcover, Mar 05 2013 *)

PARI

m=40; x='x+O('x^m); Vec(prod(k=1, m, 1/(1-x^k)^k^2)) \\ G. C. Greubel, Oct 29 2018

SageMath

# uses[EulerTransform from A166861]
b = EulerTransform(lambda n: n^2)
print([b(n) for n in range(32)]) # Peter Luschny, Nov 11 2020

Formula

a(n) = 1/n * Sum_{k=1..n} a(n-k)*sigma_3(k), n > 0, a(0)=1, where sigma_3(n) = A001158(n) = sum of cubes of divisors of n. - Vladeta Jovovic, Jan 20 2002

G.f.: Prod_{n>=1} exp(sigma_3(n)*x^n/n), where sigma_3(n) is the sum of cubes of divisors of n (=A001158(n)). - N-E. Fahssi, Mar 28 2010

G.f. (conjectured): 1/Product_{n>=1} E(x^n)^J2(n) where E(x) = Product_{n>=1} 1-x^n and J2(n) = A007434(n) [follows from the identity Sum_{d|n} J2(d) = n^2 - Peter Bala, Feb 02 2025]. - Joerg Arndt, Jan 25 2011

a(n) ~ exp(4 * Pi * n^(3/4) / (3^(5/4) * 5^(1/4)) - Zeta(3) / (4*Pi^2)) / (2^(3/2) * 15^(1/8) * n^(5/8)), where Zeta(3) = A002117 = 1.2020569031595942853997... . - Vaclav Kotesovec, Feb 27 2015

Extensions

Definition corrected by Franklin T. Adams-Watters and R. J. Mathar, Dec 04 2006