The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A172584 Number of 4*n X 3*n 0..1 arrays with row sums 3 and column sums 4. 1
1, 60871300, 2407147216735338000, 4847907059804908291247055000000, 189746842198224628153363826062842999921000000, 80261625461932627702056015943137363301590520498062576000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = 24^(-3n)*(3n)!(4n)!*Sum_{i=0..2n} Sum_{j=0..min(3n-i, 4n-2i)} Sum_{k=0..min(3n-j-i, 4n-2i-j)} ((-1)^j*3^i*6^j*8^k*(12n-4i-2j-3k)!/((3n-i-j-k)!i!j!k!(4n-2i-j-k)!*6^(4n-2i-j-k))). - Shanzhen Gao, Feb 19 2010
a(n) ~ sqrt(Pi) * 2^(11*n + 3/2) * 3^(5*n + 1/2) * n^(12*n + 1/2) / exp(12*n + 3). - Vaclav Kotesovec, Oct 22 2023
MATHEMATICA
Table[24^(-3*n)*(3*n)!*(4*n)! * Sum[Sum[Sum[((-1)^j*3^i*6^j*8^k*(12*n-4*i-2*j-3*k)! / ((3*n-i-j-k)!*i!*j!*k!*(4*n-2*i-j-k)!*6^(4*n-2*i-j-k))), {k, 0, Min[3*n-j-i, 4*n-2*i-j]}], {j, 0, Min[3*n-i, 4*n-2*i]}], {i, 0, 2*n}], {n, 1, 12}] (* Vaclav Kotesovec, Oct 22 2023 *)
PROG
(PARI) a(n) = 24^(-3*n)*(3*n)!*(4*n)!*sum(i=0, 2*n, sum(j=0, min(3*n-i, 4*n-2*i), sum(k=0, min(3*n-j-i, 4*n-2*i-j), ((-1)^j*3^i*6^j*8^k*(12*n-4*i-2*j-3*k)!/((3*n-i-j-k)!*i!*j!*k!*(4*n-2*i-j-k)!*6^(4*n-2*i-j-k)))))); \\ Michel Marcus, Jan 18 2018
CROSSREFS
Sequence in context: A017470 A017602 A227285 * A210354 A309062 A022218
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 06 2010
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 20 06:19 EDT 2024. Contains 372703 sequences. (Running on oeis4.)