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!)
A108078 Determinant of a Hankel matrix with factorial elements. 2

%I #46 Jul 25 2021 01:25:42

%S 1,2,12,576,414720,7166361600,4334215495680000,

%T 125824009525788672000000,230121443546659694208614400000000,

%U 33669808475874225917238947767910400000000000,487707458060712424140716248549520230160793600000000000000

%N Determinant of a Hankel matrix with factorial elements.

%C The term (n=1) is a degenerate case, a matrix with single element 2. This sequence involves products of binomial coefficients and is related to the superfactorial function.

%D M. J. C. Gover, "The Explicit Inverse of Factorial Hankel Matrices", Department of Mathematics, University of Bradford, 1993

%H Alois P. Heinz, <a href="/A108078/b108078.txt">Table of n, a(n) for n = 0..32</a>

%H IPJFACT, <a href="https://web.archive.org/web/20060920043138/http://www.csit.fsu.edu/~burkardt/m_src/test_matrix/ipjfact.m">IPJFACT</a>.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/BarnesG-Function.html">Barnes G-Function</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Barnes_G-function">Barnes G-function</a>

%F a(n) = (n+1)! * Product_{i=1..n-1} (i+1)! * (n-i)!.

%F a(n) = A059332(n)*(n+1)!.

%F a(n) ~ n^(n^2 + 2*n + 11/6) * 2^(n+1) * Pi^(n+1) / (A^2 * exp(3*n^2/2 + 2*n - 1/6)), where A = A074962 is the Glaisher-Kinkelin constant. - _Vaclav Kotesovec_, Apr 16 2016

%F a(n) = G(n+1) * G(n+3), where G(n) is the Barnes G function. - _Jan Mangaldan_, May 22 2016

%p with(LinearAlgebra):

%p a:= n-> Determinant(Matrix(n, (i,j)->(i+j)!)):

%p seq(a(n), n=0..10); # _Alois P. Heinz_, Dec 05 2015

%p # second Maple program:

%p a:= n-> (n+1)! * mul((i+1)!*(n-i)!, i=1..n-1):

%p seq(a(n), n=0..10); # _Alois P. Heinz_, Dec 05 2015

%t A108078[n_]:=Det[Table[(i+j)!,{i,1,n},{j,1,n}]]; Array[A108078, 20] (* _Enrique PĂ©rez Herrero_, May 20 2011 *)

%t Table[BarnesG[n + 1] BarnesG[n + 3], {n, 20}] (* _Jan Mangaldan_, May 22 2016 *)

%o (MATLAB)

%o % the sequence is easily made by:

%o for i=1:n det(gallery('ipjfact',i,0)) end

%o % or, more explicitly, by:

%o d = 1; for i=1:n-1 d = d*factorial(i+1)*factorial(n-i); end d = d*factorial(n+1);

%Y Cf. A000178, A002514, A024356, A056886, A056887, A059332, A293707.

%K easy,nonn

%O 0,2

%A _Paul Max Payton_, Jun 03 2005

%E a(0)=1 prepended and some terms corrected by _Alois P. Heinz_, Dec 05 2015

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 April 23 12:08 EDT 2024. Contains 371912 sequences. (Running on oeis4.)