login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A306907 a(n) = Product_{i=0..n, j=0..n, k=0..n} (i*j*k + 1). 3
1, 2, 60750, 193002701276968128000000, 5076574217867350877310882935055477754989937924247841796875000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Next term is too long to be included.

LINKS

Table of n, a(n) for n=0..4.

FORMULA

a(n) = (n!)^(3*n^2) * Product_{i=1..n, j=1..n, k=1..n} (1 + 1/(i*j*k)).

a(n) ~ exp(3*n^2*log(Gamma(n+1)) + (gamma + PolyGamma(0, n+1))^3 - c), where gamma is the Euler-Mascheroni constant A001620 and c = A307106 = Sum_{k>=2} (-1)^k * Zeta(k)^3 / k = 1.836921908595663783265640880112170343162564662453544904457...

a(n) ~ (2*Pi)^(3*n^2/2) * exp(-3*n^3 + n/4 + (log(n))^3 + 3*gamma*(log(n))^2 + gamma^3 - c) * n^(3*(n^3 + n^2/2 + gamma^2)).

MATHEMATICA

Table[Product[i*j*k+1, {i, 0, n}, {j, 0, n}, {k, 0, n}], {n, 0, 5}]

CROSSREFS

Cf. A306760, A307106.

Sequence in context: A153924 A059764 A285694 * A052427 A051833 A213619

Adjacent sequences:  A306904 A306905 A306906 * A306908 A306909 A306910

KEYWORD

nonn

AUTHOR

Vaclav Kotesovec, Mar 25 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 24 00:38 EST 2020. Contains 332195 sequences. (Running on oeis4.)