A380581 -id:A380581 - cp's OEIS frontend

A283271 Expansion of exp( Sum_{n>=1} -sigma_5(n)*x^n/n ) in powers of x.

1, -1, -16, -65, -55, 807, 4809, 13135, 550, -169070, -862710, -2281174, -1221309, 20194565, 114391575, 346400092, 486546751, -1239516671, -11089537215, -41702958960, -93143227027, -45337210750, 674845109986, 3682196642725, 11405949184465, 20796945542222

Offset: 0

Seiichi Manyama, Mar 04 2017

sign

Let A(x) denote the g.f. and let m be an integer. Define a sequence by u(n) = [x^n] A(x)^(m*n). We conjecture that the supercongruence u(n*p^r) == u(n*p^(r-1)) (mod p^(3*r)) holds for all positive integers n and r and all primes p >= 7. Cf. A380581. - Peter Bala, Jan 21 2025

Seiichi Manyama, Table of n, a(n) for n = 0..1000

Column k=4 of A283272.
Cf. A023873 (exp( Sum_{n>=1} sigma_5(n)*x^n/n )).
Cf. exp( Sum_{n>=1} -sigma_k(n)*x^n/n ): A010815 (k=1), A073592 (k=2), A283263 (k=3), A283264 (k=4), this sequence (k=5).

G.f.: Product_{n>=1} (1 - x^n)^(n^4).

a(n) = -(1/n)*Sum_{k=1..n} sigma_5(k)*a(n-k).

A023873 Expansion of Product_{k>=1} (1 - x^k)^(-k^4).

Original entry on oeis.org

1, 1, 17, 98, 490, 2411, 11940, 56093, 256274, 1140980, 4977222, 21273772, 89281011, 368408970, 1496993290, 5996312751, 23700208290, 92510062036, 356887002352, 1361671469470, 5141380256124, 19221678032134, 71190778935805, 261320839754142, 951091521384860

Offset: 0

Olivier Gérard

Seiichi Manyama, Table of n, a(n) for n = 0..3339 (first 801 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.

Column k=4 of A144048.

Cf. A283271, A380581.

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

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

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

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

a(n) ~ exp(Pi * 2^(3/2) * 3^(2/3) * n^(5/6) / (5 * 7^(1/6)) + 3*Zeta(5) / (4*Pi^4)) / (2^(3/4) * 3^(2/3) * 7^(1/12) * n^(7/12)), where Zeta(5) = A013663 = 1.036927755143369926... . - Vaclav Kotesovec, Feb 27 2015
G.f.: exp( Sum_{n>=1} sigma_5(n)*x^n/n ). - Seiichi Manyama, Mar 04 2017
a(n) = (1/n)*Sum_{k=1..n} sigma_5(k)*a(n-k). - Seiichi Manyama, Mar 04 2017

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

A380290 a(n) = [x^n] G(x)^n, where G(x) = Product_{k >= 1} 1/(1 - x^k)^(k^2) is the g.f. of A023871.

Original entry on oeis.org

1, 1, 11, 73, 539, 3976, 30107, 229811, 1771803, 13749742, 107305836, 841211966, 6619647419, 52258136399, 413682035393, 3282569032273, 26101575743771, 207930807629248, 1659134361686186, 13258065574274885, 106084302933126364, 849845499077000534, 6815530442695480418, 54712839001004065090

Offset: 0

Peter Bala, Jan 19 2025

Given an integer sequence {f(n) : n >= 0} with f(0) = 1, there is a unique power series F(x) with rational coefficients, where F(0) = 1, such that f(n) = [x^n] F(x)^n. F(x) is given by F(x) = series_reversion(x/E(x)), where E(x) = exp(Sum_{n >= 1} f(n)*x^n/n). Furthermore, if the series E(x) has integer coefficients then the series F(x) also has integer coefficients and the sequence {f(n)} satisfies the Gauss congruences: f(n*p^r) == f(n*p^(r-1)) (mod p^r) for all primes p and positive integers n and r (by Stanley, Ch. 5, Ex. 5.2(a), p. 72 and the Lagrange inversion formula).
Thus the present sequence satisfies the Gauss congruences. In fact, stronger congruences appear to hold for the present sequence.
We conjecture that a(p) == 1 (mod p^3) for all primes p >= 7 (checked up to p = 61).
More generally, we conjecture that the supercongruence a(n*p^r) == a(n*p^(r-1)) (mod p^(3*r)) holds for all primes p >= 7 and positive integers n and r. Some examples are given below.

			Examples of supercongruences:
a(7) - a(1) = 229811 - 1 = 2*5*(7^3)*67 == 0 (mod 7^3)
a(3*7) - a(3) = 849845499077000534 - 73 = (7^3)*29243*84727410689 == 0 (mod 7^3)
a(19) - a(1) = 13258065574274885 - 1 = (2^2)*11*(19^3)*29*26723*56687 == 0 (mod 19^3)

R. P. Stanley. Enumerative combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999.

Vaclav Kotesovec, Table of n, a(n) for n = 0..1000
Peter Bala, Notes on A380290 and A380291

Cf. A023871, A001158, A023873, A283263, A380291, A380581, A380582, A380583.

Cf. A008485, A255672, A386720.

with(numtheory):
G(x) := series(exp(add(sigma[3](k)*x^k/k, k = 1..23)),x,24):
seq(coeftayl(G(x)^n, x = 0, n), n = 0..23);

Table[SeriesCoefficient[Product[1/(1 - x^k)^(n*k^2), {k, 1, n}], {x, 0, n}], {n, 0, 25}] (* Vaclav Kotesovec, Jul 30 2025 *)
(* or *)
Table[SeriesCoefficient[Exp[n*Sum[DivisorSigma[3, k]*x^k/k, {k, 1, n}]], {x, 0, n}], {n, 0, 25}] (* Vaclav Kotesovec, Jul 30 2025 *)

a(n) = [x^n] exp(n*Sum_{k >= 1} sigma_3(k)*x^k/k).

a(n) ~ c * d^n / sqrt(n), where d = 8.20432131153340331179513077696629277558952852444670658917204305357709... and c = 0.2513708881073263860977360125648021910598660424705749139651716452651... - Vaclav Kotesovec, Jul 30 2025

A380582 a(n) = [x^n] G(x)^n, where G(x) = Product_{k >= 1} ((1 + x^k)/(1 - x^k))^(k^2) is the g.f. of A206622.

Original entry on oeis.org

1, 2, 24, 236, 2432, 25752, 277152, 3019088, 33186816, 367378814, 4089875024, 45741207228, 513537853952, 5784253405192, 65332622356032, 739706089046736, 8392732289277952, 95401363286044260, 1086232605119042424, 12386037358495697292, 141422619808922418432, 1616691574828234720352

Offset: 0

Peter Bala, Jan 27 2025

Given an integer sequence {f(n) : n >= 0} with f(0) = 1, there is a unique power series F(x) with rational coefficients, where F(0) = 1, such that f(n) = [x^n] F(x)^n. F(x) is given by F(x) = series_reversion(x/E(x)), where E(x) = exp(Sum_{n >= 1} f(n)*x^n/n). Furthermore, if the series E(x) has integer coefficients then the series F(x) also has integer coefficients and the sequence {f(n)} satisfies the Gauss congruences: f(n*p^r) == f(n*p^(r-1)) (mod p^r) for all primes p and positive integers n and r (by Stanley, Ch. 5, Ex. 5.2(a), p. 72 and the Lagrange inversion formula).
Thus the present sequence satisfies the Gauss congruences. In fact, stronger congruences appear to hold for this sequence.
We conjecture that a(p) == 1 (mod p^3) for all primes p >= 5 (checked up to p = 61).
More generally, we conjecture that the supercongruence a(n*p^r) == a(n*p^(r-1)) (mod p^(3*r)) holds for all primes p >= 5 and positive integers n and r. Some examples are given below.
Let A, B be integers and let C be a positive integer. Define u(n) = [x^(C*n)] Product_{k >= 1} ((1 + x^k)^A * (1 - x^k)^B)^(k^2). The present sequence is the case A = 1, B = -1 and C = 1. We conjecture that the above supercongruences also hold for the sequence {u(n)} for all primes p >= 7.

			Examples of supercongruences:
a(7) - a(1) = 3019088 - 2 = 2*(3^3)*(7^3)*163 == 0 (mod 7^3)
a(13) - a(1) = 5784253405192 - 2 = 2*5*(13^4)*20252279 == 0 (mod 13^4)
a(2*11) - a(2) = 18501616629347623668448 - 24 = (2^3)*(11^3)*17*1951*4243*9817*1257719 == 0 (mod 11^3)
a(5^2) - a(5) = 1884578634304981694792832319004 - 256504 = (2^2)*(5^6)*193381* 155926684363405438573 == 0 (mod 5^6)

Cf. A001158, A015128, A206622, A380290, A380581, A380583.

with(numtheory):
G(x) := series(exp(add( (1/4)*(sigma[3](2*k) - sigma[3](k))*x^k/k, k = 1..23 )),x,24):
seq(coeftayl(G(x)^n, x = 0, n), n = 0..23);

a(n) = [x^n] exp( n*Sum_{k >= 1} (sigma_3(2*k) - sigma_3(k))/4 * x^k/k ).

A380583 a(n) = [x^n] G(x)^n, where G(x) = Product_{k >= 1} ((1 + x^(2*k))/(1 - x^k))^(k^2).

Original entry on oeis.org

1, 1, 13, 82, 665, 5026, 40180, 319677, 2583401, 20965150, 171276238, 1405008925, 11571476120, 95601033542, 792038546739, 6577523807332, 54737967873385, 456368114019558, 3811136362823056, 31873576059000827, 266919720010452190, 2237944814420991135, 18784073017650350445

Offset: 0

Peter Bala, Jan 27 2025

The sequence satisfies the Gauss congruences: a(n*p^r) == a(n*p^(r-1)) (mod p^r) for all primes p and for all positive integers n and r. In fact, stronger congruences appear to hold for this sequence.
We conjecture that a(p) == 1 (mod p^3) for all primes p >= 7.
More generally, we conjecture that the supercongruence a(n*p^r) == a(n*p^(r-1)) (mod p^(3*r)) holds for all primes p >= 7 and positive integers n and r. Some examples are given below.
Let A and B be integers. Let C be a positive integer. Define u(n) = [x^(C*n)] Product_{k >= 1} ((1 + - x^(2*k))^A * (1 + - x^k)^B)^(k^2). The present sequence is the case A = 1, B = -1 and C = 1, with the appropriate choice of signs. We conjecture that the above supercongruences also hold for the sequence {u(n)} for all primes p >= 7.

			Examples of supercongruences:
a(7) - a(1) = 319677 - 1 = (2^2)*(7^3)*233 == 0 (mod 7^3)
a(11) - a(1) = 1405008925 - 1 = (2^2)*3*(11^5)*727 == 0 (mod 11^5)
a(22) - a(2) = 18784073017650350445 - 13 = (2^5)*(11^3)*222773*1979699077 == 0 (mod 11^3)

Cf. A380290, A380581, A380582.

G(x) := series(mul( ( (1 + x^(2*k))/(1 - x^k) )^(k^2), k = 1..22), x, 23):
a:= n-> coeftayl(G(x)^n, x = 0, n):
seq(a(n), n = 0..22);

cp's OEIS Frontend

A283271 Expansion of exp( Sum_{n>=1} -sigma_5(n)*x^n/n ) in powers of x.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A023873 Expansion of Product_{k>=1} (1 - x^k)^(-k^4).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A380290 a(n) = [x^n] G(x)^n, where G(x) = Product_{k >= 1} 1/(1 - x^k)^(k^2) is the g.f. of A023871.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A380582 a(n) = [x^n] G(x)^n, where G(x) = Product_{k >= 1} ((1 + x^k)/(1 - x^k))^(k^2) is the g.f. of A206622.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Formula

A380583 a(n) = [x^n] G(x)^n, where G(x) = Product_{k >= 1} ((1 + x^(2*k))/(1 - x^k))^(k^2).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple