The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A325049 a(n) = Product_{i=0..n, j=0..n} (i!*j! + 1). 1
 2, 16, 6480, 97287175440, 1106928595945936328906250000, 856337316801926460412829104011102303451051923953906250000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Table of n, a(n) for n=0..5. FORMULA a(n) ~ c * (2*Pi)^((n+1)^2) * n^((n+1)*(6*n^2 + 12*n + 5)/6) / (A^(2*n+2) * exp(3*n^3/2 + 7*n^2/2 + 11*n/6 - 1/3)), where c = Product_{i>=0, j>=0} (1 + 1/(i!*j!)) = 297.557220207478770881166673701943476275955597334672817171839377... and A is the Glaisher-Kinkelin constant A074962. MATHEMATICA Table[Product[i!*j! + 1, {i, 0, n}, {j, 0, n}], {n, 0, 7}] Table[BarnesG[n+2]^(2*n+2) * Product[1 + 1/(i!*j!), {i, 0, n}, {j, 0, n}], {n, 0, 7}] PROG (Python) from math import prod, factorial as f def a(n): return prod(f(i)*f(j)+1 for i in range(n) for j in range(n)) print([a(n) for n in range(1, 7)]) # Michael S. Branicky, Feb 16 2021 CROSSREFS Cf. A306760, A325051. Sequence in context: A180962 A324565 A306729 * A334912 A092798 A333540 Adjacent sequences: A325046 A325047 A325048 * A325050 A325051 A325052 KEYWORD nonn AUTHOR Vaclav Kotesovec, Mar 26 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 3 19:10 EST 2023. Contains 367540 sequences. (Running on oeis4.)