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!)
A306729 a(n) = Product_{i=0..n, j=0..n} (i! + j!). 6

%I #30 Nov 20 2023 04:15:07

%S 2,16,5184,9559130112,109045776752640000000000,

%T 27488263744928988967331390258832998400000000000,

%U 1147897050240877062218236820013018349788772091106840426434074807527014400000000000000

%N a(n) = Product_{i=0..n, j=0..n} (i! + j!).

%F a(n) ~ c * 2^(n^2/2 + 2*n) * Pi^(n^2/2 + n) * n^(2*n^3/3 + 2*n^2 + 11*n/6 + 5/2) / exp(8*n^3/9 + 2*n^2 + n), where c = A324569 = 62.14398692334529025548974541735...

%F a(n) = a(n-1) * A323717(n)^2 / (2*n!). - _Vaclav Kotesovec_, Mar 28 2019

%t Table[Product[i! + j!, {i, 0, n}, {j, 0, n}], {n, 0, 7}]

%t Clear[a]; a[n_] := a[n] = If[n == 0, 2, a[n-1] * Product[k! + n!, {k, 0, n}]^2 / (2*n!)]; Table[a[n], {n, 0, 7}] (* _Vaclav Kotesovec_, Mar 27 2019 *)

%t Table[Product[Product[k! + j!, {k, 0, j}], {j, 1, n}]^2 / (2^(n-1) * BarnesG[n + 2]), {n, 0, 7}] (* _Vaclav Kotesovec_, Mar 27 2019 *)

%o (Python)

%o from math import prod, factorial as f

%o def a(n): return prod(f(i)+f(j) for i in range(n) for j in range(n))

%o print([a(n) for n in range(1, 8)]) # _Michael S. Branicky_, Feb 16 2021

%Y Cf. A000178, A055462, A079478, A203482, A217757, A323717, A324403, A325052.

%K nonn

%O 0,1

%A _Vaclav Kotesovec_, Mar 06 2019

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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)