A008978 -id:A008978 - cp's OEIS frontend

A008977 a(n) = (4*n)!/(n!)^4.

1, 24, 2520, 369600, 63063000, 11732745024, 2308743493056, 472518347558400, 99561092450391000, 21452752266265320000, 4705360871073570227520, 1047071828879079131681280, 235809301462142612780721600, 53644737765488792839237440000, 12309355935372581458927646400000

Offset: 0

N. J. A. Sloane

Number of paths of length 4*n in an n X n X n X n grid from (0,0,0,0) to (n,n,n,n).
a(n) occurs in Ramanujan's formula 1/Pi = (sqrt(8)/9801) * Sum_{n>=0} (4*n)!/(n!)^4 * (1103 + 26390*n)/396^(4*n). - Susanne Wienand, Jan 05 2013
a(n) is the number of ballot results that lead to a 4-way tie when 4*n voters each cast three votes for three out of four candidates vying for 3 slots on a county commission; each of these ballot results give 3*n votes to each of the four candidates. - Dennis P. Walsh, May 02 2013
a(n) is the constant term of (X + Y + Z + 1/(X*Y*Z))^(4*n). - Mark van Hoeij, May 07 2013
In Narumiya and Shiga on page 158 the g.f. is given as a hypergeometric function. - Michael Somos, Aug 12 2014
Diagonal of the rational function R(x,y,z,w) = 1/(1-(w+x+y+z)). - Gheorghe Coserea, Jul 15 2016

			a(13)=52!/(13!)^4=53644737765488792839237440000 is the number of ways of dealing the four hands in Bridge or Whist. - _Henry Bottomley_, Oct 06 2000
a(1)=24 since, in a 4-voter 3-vote election that ends in a four-way tie for candidates A, B, C, and D, there are 4! ways to arrange the needed vote sets {A,B,C}, {A,B,D}, {A,C,D}, and {B,C,D} among the 4 voters. - _Dennis P. Walsh_, May 02 2013
G.f. = 1 + 24*x + 2520*x^2 + 369600*x^3 + 63063000*x^4 + 11732745024*x^5 + ...

T. D. Noe, Table of n, a(n) for n=0..100
R. M. Dickau, Paths through a 4-D lattice.
S. Hassani, J.-M. Maillard, and N. Zenine, On the diagonals of rational functions: the minimal number of variables (unabridged version), arXiv:2502.05543 [math-ph], 2025. See pp. 41.
Timothy Huber, Daniel Schultz, and Dongxi Ye, Ramanujan-Sato series for 1/pi, Acta Arith. (2023) Vol. 207, 121-160. See p. 11.
Markus Kuba and Alois Panholzer, Lattice paths and the diagonal of the cube, arXiv:2411.03930 [math.CO], 2024.
R. Mestrovic, Wolstenholme's theorem: Its Generalizations and Extensions in the last hundred and fifty years (1862-2011), arXiv:1111.3057 [math.NT], 2011.
Michaël Moortgat, The Tamari order for D^3 and derivability in semi-associative Lambek-Grishin Calculus, 15th Workshop: Computational Logic and Applications (CLA 2020).
N. Narumiya and H. Shiga, The mirror map for a family of K3 surfaces induced from the simplest 3-dimensional reflexive polytope, Proceedings on Moonshine and related topics (Montréal, QC, 1999), 139-161, CRM Proc. Lecture Notes, 30, Amer. Math. Soc., Providence, RI, 2001. MR1877764 (2002m:14030).

Cf. A000984, A006480, A008978, A178529, A000897, A002894, A002897, A006480, A008979, A186420, A188662.
Row 4 of A187783.
Related to diagonal of rational functions: A268545-A268555.

[Factorial(4*n)/Factorial(n)^4: n in [0..20]]; // Vincenzo Librandi, Aug 13 2014

Maple
```
A008977 := n->(4*n)!/(n!)^4;
```

Table[(4n)!/(n!)^4,{n,0,16}] (* Harvey P. Dale, Oct 24 2011 *)
a[ n_] := If[ n < 0, 0, (4 n)! / n!^4]; (* Michael Somos, Aug 12 2014 *)
a[ n_] := SeriesCoefficient[ HypergeometricPFQ[ {1/4, 2/4, 3/4}, {1, 1}, 256 x], {x, 0, n}]; (* Michael Somos, Aug 12 2014 *)

A008977(n):=(4*n)!/(n!)^4$ makelist(A008977(n),n,0,20); /* Martin Ettl, Nov 15 2012 */

a(n) = (4*n)!/n!^4; \\ Gheorghe Coserea, Jul 15 2016

from math import factorial
def A008977(n): return factorial(n<<2)//factorial(n)**4 # Chai Wah Wu, Mar 15 2023

a(n) = A139541(n)*(A001316(n)/A049606(n))^3. - Reinhard Zumkeller, Apr 28 2008
Self-convolution of A178529, where A178529(n) = (4^n/n!^2) * Product_{k=0..n-1} (8*k + 1)*(8*k + 3).
G.f.: hypergeom([1/8, 3/8], [1], 256*x)^2. - Mark van Hoeij, Nov 16 2011
a(n) ~ 2^(8*n - 1/2) / (Pi*n)^(3/2). - Vaclav Kotesovec, Mar 07 2014
G.f.: hypergeom([1/4, 2/4, 3/4], [1, 1], 256*x). - Michael Somos, Aug 12 2014
From Peter Bala, Jul 12 2016: (Start)
a(n) = binomial(2*n,n)*binomial(3*n,n)*binomial(4*n,n) = ( [x^n](1 + x)^(2*n) ) * ( [x^n](1 + x)^(3*n) ) * ( [x^n](1 + x)^(4*n) ) = [x^n](F(x)^(24*n)), where F(x) = 1 + x + 29*x^2 + 2246*x^3 + 239500*x^4 + 30318701*x^5 + 4271201506*x^6 + ... appears to have integer coefficients. For similar results see A000897, A002894, A002897, A006480, A008978, A008979, A186420 and A188662. (End)
0 = (x^2-256*x^3)*y''' + (3*x-1152*x^2)*y'' + (1-816*x)*y' - 24*y, where y is the g.f. - Gheorghe Coserea, Jul 15 2016
From Peter Bala, Jul 17 2016: (Start)
a(n) = Sum_{k = 0..3*n} (-1)^(n+k)*binomial(4*n,n + k)* binomial(n + k,k)^4.
a(n) = Sum_{k = 0..4*n} (-1)^k*binomial(4*n,k)*binomial(n + k,k)^4. (End)
E.g.f.: 3F3(1/4,1/2,3/4; 1,1,1; 256*x). - Ilya Gutkovskiy, Jan 23 2018
From Peter Bala, Feb 16 2020: (Start)
a(m*p^k) == a(m*p^(k-1)) ( mod p^(3*k) ) for prime p >= 5 and positive integers m and k - apply Mestrovic, equation 39, p. 12.
a(n) = [(x*y*z)^n] (1 + x + y + z)^(4*n). (End)
D-finite with recurrence n^3*a(n) -8*(4*n-3)*(2*n-1)*(4*n-1)*a(n-1)=0. - R. J. Mathar, Aug 01 2022
a(n) = 24*A082368(n). - R. J. Mathar, Jun 21 2023

A034841 a(n) = (n^2)! / (n!)^n.

Original entry on oeis.org

1, 1, 6, 1680, 63063000, 623360743125120, 2670177736637149247308800, 7363615666157189603982585462030336000, 18165723931630806756964027928179555634194028454000000, 53130688706387569792052442448845648519471103327391407016237760000000000

Offset: 0

Erich Friedman

nonn

The number of arrangements of 1,2,...,n^2 in an n X n matrix such that each row is increasing. - Ahmed Fares (ahmedfares(AT)my-deja.com), Jul 12 2001
a(n) == 0 (mod n!). In fact (n^2)! == 0 (mod (n!)^n) by elementary combinatorics, a better result is (n^2)! == 0 (mod (n!)^(n+1)). - Amarnath Murthy, Jul 13 2005
a(n) is also the number of lattice paths from {n}^n to {0}^n using steps that decrement one component by 1. a(2) = 6: [(2,2), (1,2), (0,2), (0,1), (0,0)], [(2,2), (1,2), (1,1), (0,1), (0,0)], [(2,2), (1,2), (1,1), (1,0), (0,0)], [(2,2), (2,1), (1,1), (0,1), (0,0)], [(2,2), (2,1), (1,1), (1,0), (0,0)], [(2,2), (2,1), (2,0), (1,0), (0,0)]. - Alois P. Heinz, May 06 2013
Given n^2 distinguishable balls and n distinguishable urns, a(n) = the number of ways to place n balls in the i-th urn for all 1 <= i <= n, where n = n_1 + n_2 + ... + n_n. - Ross La Haye, Dec 28 2013

Alois P. Heinz and Tilman Piesk, Table of n, a(n) for n = 0..26 (first 20 terms from Alois P. Heinz)
Noah Lordi, Maedee Trank-Greene, Akira Kyle, and Joshua Combes, Quantum permutation puzzles with indistinguishable particles, arXiv:2410.22287 [quant-ph], 2024. See p. 8.

Cf. A000142, A039622, A229050, A229050, A340590.
Cf. A000984, A006480, A008977, A008978, A022915.
Main diagonal of A089759, A187783.

[Factorial(n^2) / Factorial(n)^n: n in [0..10]]; // Vincenzo Librandi, Oct 29 2014

a:= n-> (n^2)! / (n!)^n:
seq(a(n), n=0..10);  # Alois P. Heinz, Jul 24 2012

Prepend[Table[nn = n^2;nn! Coefficient[Series[(x^n/n!)^n, {x, 0, nn}], x^nn], {n, 1, 15}], 1] (* Geoffrey Critzer, Mar 08 2015 *)

a(n) = (n^2)! / (n!)^n; \\ Michel Marcus, Oct 28 2014

Using a higher order version of Stirling's formula (the "standard" formula appears in A000142) we have the asymptotic expression: a(n) ~ sqrt(2*Pi) * e^(-1/12) * n^(n^2 - n/2 + 1) / (2*Pi)^(n/2). - Dan Fux (dan.fux(AT)OpenGaia.com or danfux(AT)OpenGaia.com), Apr 13 2001

a(n) = Product_{k=1..n} binomial(k*n, n). - Vaclav Kotesovec, Mar 10 2019

a(0)=1 prepended by Tilman Piesk, Oct 28 2014

A187783 De Bruijn's triangle, T(m,n) = (m*n)!/(n!^m) read by downward antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 6, 6, 1, 1, 1, 20, 90, 24, 1, 1, 1, 70, 1680, 2520, 120, 1, 1, 1, 252, 34650, 369600, 113400, 720, 1, 1, 1, 924, 756756, 63063000, 168168000, 7484400, 5040, 1

Offset: 0

Robert G. Wilson v, Jan 05 2013

From Tilman Piesk, Oct 28 2014: (Start)
Number of permutations of a multiset that contains m different elements n times. These multisets have the signatures A249543(m,n-1) for m>=1 and n>=2.
In an m-dimensional Pascal tensor (the generalization of a symmetric Pascal matrix) P(x1,...,xn) = (x1+...+xn)!/(x1!*...*xn!), so the main diagonal of an m-dimensional Pascal tensor is D(n) = (m*n)!/(n!^m). These diagonals are the rows of this array (with m>0), which begins like this:
  m\n:0   1       2            3                4                    5
  0:  1   1       1            1                1                    1 ... A000012;
  1:  1   1       1            1                1                    1 ... A000012;
  2:  1   2       6           20               70                  252 ... A000984;
  3:  1   6      90         1680            34650               756756 ... A006480;
  4:  1  24    2520       369600         63063000          11732745024 ... A008977;
  5:  1 120  113400    168168000     305540235000      623360743125120 ... A008978;
  6:  1 720 7484400 137225088000 3246670537110000 88832646059788350720 ... A008979;
with columns: A000142 (n=1), A000680 (n=2), A014606 (n=3), A014608 (n=4), A014609 (n=5).
A089759 is the transpose of this matrix. A034841 is its diagonal. A141906 is its lower triangle. A120666 is the upper triangle of this matrix with indices starting from 1. A248827 are the diagonal sums (or the row sums of the triangle).
(End)

			T(3,5) = (3*5)!/(5!^3) = 756756 = A014609(3) = A006480(5) is the number of permutations of a multiset that contains 3 different elements 5 times, e.g., {1,1,1,1,1,2,2,2,2,2,3,3,3,3,3}.

Tilman Piesk, First 54 rows of the triangle, flattened
T. Chappell, A. Lascoux, S. Ole Warnaar, and W. Zudilin, Logarithmic and complex constant term identities, arXiv:1112.3130 [math.CO], 2012.
Tilman Piesk, Array for indices 0..16
Tilman Piesk, PHP code used to create the b-file
Tilman Piesk, Illustration of the multisets for m,n=0..4
Wikipedia, Permutations of multisets, Pascal matrix and simplex

Cf. A089759 (transposed), A141906 (subtriangle), A120666 (subtriangle transposed), A060538 (1st row/column removed).
Rows: A000012, A000984, A006480, A006480, A008978, A008979, A071549, A071550, A071551, A071552.
Columns: A000012, A000142, A000680, A014606, A014608, A014609, A248814, A172603, A172609, A172613.
Main diagonal gives: A034841.
Row sums of the triangle: A248827.

[Factorial(k*(n-k))/(Factorial(n-k))^k: k in [0..n], n in [0..10]]; // G. C. Greubel, Dec 26 2022

T[n_, k_]:= (k*n)!/(n!)^k; Table[T[n, k-n], {k, 9}, {n, 0, k-1}]//Flatten

def A187783(n,k): return gamma(k*(n-k)+1)/(factorial(n-k))^k
flatten([[A187783(n,k) for k in range(n+1)] for n in range(11)]) # G. C. Greubel, Dec 26 2022

T(m,n) = (m*n)!/(n!)^m.

A060540(m,n) = T(m,n)/m! . - R. J. Mathar, Jun 21 2023

Row m=0 prepended by Tilman Piesk, Oct 28 2014

A008979 a(n) = (6n)!/(n!)^6.

Original entry on oeis.org

1, 720, 7484400, 137225088000, 3246670537110000, 88832646059788350720, 2670177736637149247308800, 85722533226982363751829504000, 2889253496242619386328267523990000, 101097362223624462291180422369532000000, 3644153415887633116359073848179365185734400, 134567406165969006655507763343147223231094784000

Offset: 0

N. J. A. Sloane

Vincenzo Librandi, Table of n, a(n) for n = 0..100
R. Mestrovic, Wolstenholme's theorem: Its Generalizations and Extensions in the last hundred and fifty years (1862-2011), arXiv:1111.3057 [math.NT], 2011.

Cf. A000897, A000984, A002894, A002897, A006480, A008977, A008978, A071549, A071550, A071551, A071552, A186420, A188662.

[Factorial(6*n)/Factorial(n)^6: n in [0..20]]; // Vincenzo Librandi, Aug 13 2014

seq( (6*n)!/(n!)^6, n=0..20); # G. C. Greubel, Feb 17 2020

Table[(6 n)!/(n)!^6, {n, 0, 20}] (* Vincenzo Librandi, Aug 13 2014 *)

vector(21, n, my(m=n-1); (6*m)!/(m!)^6 ) \\ G. C. Greubel, Feb 17 2020

[factorial(6*n)/factorial(n)^6 for n in (0..20)] # G. C. Greubel, Feb 17 2020

From Peter Bala, Jul 12 2016: (Start)
a(n) = binomial(2*n,n)*binomial(3*n,n)*binomial(4*n,n)*
  binomial(5*n,n)*binomial(6*n,n) = ( [x^n](1 + x)^(2*n) ) * ( [x^n](1 + x)^(3*n) ) * ( [x^n](1 + x)^(4*n) ) * ( [x^n](1 + x)^(5*n) ) * ( [x^n](1 + x)^(6*n) ) = [x^n](F(x)^(720*n)), where F(x) = 1 + x + 4478*x^2 + 53085611*x^3 + 926072057094*x^4 + 19977558181209910*x^5 + 493286693783478576177*x^6 + ... appears to have integer coefficients. For similar results see A000897, A002894, A002897, A006480, A008977, A008978, A186420 and A188662. (End)
a(n) ~ 3^(6*n+1/2)*4^(3*n-1)/(Pi*n)^(5/2). - Ilya Gutkovskiy, Jul 12 2016
From Peter Bala, Feb 14 2020: (Start)
a(m*p^k) == a(m*p^(k-1)) ( mod p^(3*k) ) for prime p >= 5 and positive integers m and k - apply Mestrovic, equation 39, p. 12.
a(n) = [(x*y*z*u*v)^n] (1 + x + y + z + u + v)^(6*n). (End)

A023981 Sum of exponents in prime-power factorization of multinomial coefficient M(5n; n,n,n,n,n).

Original entry on oeis.org

0, 5, 10, 14, 16, 22, 24, 31, 29, 30, 33, 40, 38, 47, 49, 51, 45, 53, 51, 57, 59, 61, 63, 71, 66, 68, 75, 73, 71, 80, 78, 86, 76, 80, 83, 86, 81, 88, 93, 97, 92, 99, 100, 105, 106, 107, 108, 117, 107, 112, 112, 115, 118, 126, 120, 124, 119, 120, 127, 134, 131, 139, 143, 141, 127, 133

Offset: 0

Clark Kimberling

nonn

Amiram Eldar, Table of n, a(n) for n = 0..10000

Cf. A001222, A008978, A022559.

Cf. A023978, A023979, A023980, A023982, A023983, A023984, A023985, A023986, A023987, A023990, A023991, A023992, A023993.

a[n_] := PrimeOmega[Multinomial[n, n, n, n, n]]; Array[a, 100, 0] (* Amiram Eldar, Jun 11 2025 *)

a(n) = bigomega((5*n)! / n!^5); \\ Amiram Eldar, Jun 11 2025

From Amiram Eldar, Jun 11 2025: (Start)
a(n) = A001222(A008978(n)).
a(n) = A022559(5*n) - 5*A022559(n). (End)

Offset changed to 0 and a(0) prepended by Amiram Eldar, Jun 11 2025

A082489 a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2k,k) C(n+3k,k) C(n+4*k,k).

Original entry on oeis.org

1, 121, 114121, 169417921, 308238414121, 629799991355641, 1387152264043496161, 3220175519103433952161, 7771784978946238318454761, 19326687177288750280293146161, 49215884415076728067274047737961, 127771596843320597524806463425540481

Offset: 0

Emanuele Munarini, Apr 28 2003

Diagonal of the rational function 1 / (1 - x - y - z - u - v - x*y*z*u*v). - Ilya Gutkovskiy, Apr 22 2025

			G.f.: A(x) = 1 + 121*x + 114121*x^2 + 169417921*x^3 + 308238414121*x^4 +...
where
A(x) = 1/(1-x) + (5!/1!^5)*x/(1-x)^6 + (10!/2!^5)*x^2/(1-x)^11 + (15!/3!^5)*x^3/(1-x)^16 + (20!/4!^5)*x^4/(1-x)^21 + (25!/5!^5)*x^5/(1-x)^26 +... [Hanna]
Equivalently,
A(x) = 1/(1-x) + 120*x/(1-x)^6 + 113400*x^2/(1-x)^11 + 168168000*x^3/(1-x)^16 + 305540235000*x^4/(1-x)^21 + 623360743125120*x^5/(1-x)^26 +...+ A008978(n)*x^n/(1-x)^(5*n+1) +...

Alois P. Heinz, Table of n, a(n) for n = 0..200

Column k = 5 of A229142.

Cf. A008978, A001850, A081798, A082488, A229049, A229050.

with(combinat):
a:= n-> add(multinomial(n+4*k, n-k, k$5), k=0..n):
seq(a(n), n=0..15);  # Alois P. Heinz, Sep 23 2013

Table[Sum[Binomial[n,k]*Binomial[n+k,k]*Binomial[n+2*k,k]* Binomial[n+3*k,k]*Binomial[n+4*k,k], {k, 0, n}],{n,0,20}] (* Vaclav Kotesovec, Sep 23 2013 *)

{a(n)=polcoeff(sum(m=0, n, (5*m)!/m!^5*x^m/(1-x+x*O(x^n))^(5*m+1)), n)}
for(n=0, 15, print1(a(n), ", ")) \\ Paul D. Hanna, Sep 22 2013

{a(n)=sum(k=0, n, binomial(n, k)*binomial(n+k, k)*binomial(n+2*k, k) *binomial(n+3*k, k)*binomial(n+4*k, k))}
for(n=0, 15, print1(a(n), ", ")) \\ Paul D. Hanna, Sep 22 2013

G.f.: Sum_{n>=0} (5*n)!/n!^5 * x^n / (1-x)^(5*n+1). - Paul D. Hanna, Sep 22 2013
Recurrence: n^4*(5*n-16)*(5*n-12)*(5*n-11)*(5*n-8)*(5*n-7)*(5*n-6)*a(n) = (5*n-16)*(5*n-12)*(5*n-11)*(5*n-4)*(78250*n^6 - 422550*n^5 + 885665*n^4 - 906704*n^3 + 468906*n^2 - 114379*n + 10086)*a(n-1) - (5*n-16)*(31250*n^9 - 400000*n^8 + 2154375*n^7 - 6337750*n^6 + 11073100*n^5 - 11721380*n^4 + 7379043*n^3 - 2629646*n^2 + 489456*n - 36000)*a(n-2) + (5*n-1)*(31250*n^9 - 556250*n^8 + 4241875*n^7 - 18056500*n^6 + 46858025*n^5 - 76033760*n^4 + 76116292*n^3 - 44628880*n^2 + 13702848*n - 1693440)*a(n-3) - (5*n-6)*(5*n-2)*(5*n-1)*(625*n^7 - 11375*n^6 + 86025*n^5 - 347305*n^4 + 798274*n^3 - 1025292*n^2 + 661408*n - 156480)*a(n-4) + (n-4)^4*(5*n-11)*(5*n-7)*(5*n-6)*(5*n-3)*(5*n-2)*(5*n-1)*a(n-5). - Vaclav Kotesovec, Sep 23 2013
a(n) ~ c*d^n/n^2, where d = 3129.996806129131084... is the root of the equation -1 + 5*d - 10*d^2 + 10*d^3 - 3130*d^4 +d^5 = 0 and c = 0.05674890286773483081841276583916042181... - Vaclav Kotesovec, Sep 23 2013
exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + x + 61*x^2 + 38101*x^3 + 42394381*x^4 + ... appears to have integer coefficients. - Peter Bala, Jan 13 2016

A071549 a(n) = (7n)!/n!^7.

Original entry on oeis.org

1, 5040, 681080400, 182509367040000, 66475579247327250000, 28837919555681211870935040, 14007180988362844601443040716800, 7363615666157189603982585462030336000, 4104167472585675600759440022842715359250000, 2392741010223442438553822446842770682716580000000

Offset: 0

Benoit Cloitre, May 30 2002

nonn

Number of closed paths of length 7n whose steps are 7th roots of unity. - Andrew Howroyd, Nov 01 2018

Vincenzo Librandi, Table of n, a(n) for n = 0..100
Gilbert Labelle and Annie Lacasse, Closed paths whose steps are roots of unity, in FPSAC 2011, Reykjavik, Iceland DMTCS proc. AO, 2011, 599-610.
R. Mestrovic, Wolstenholme's theorem: Its Generalizations and Extensions in the last hundred and fifty years (1862-2011), arXiv:1111.3057 [math.NT], 2011.

Row n=7 of A187783, column k=7 of A089759.

Sequences (k*n)!/n!^k: A000984 (k = 2), A006480 (k =3), A008977 (k = 4), A008978 (k = 5), A008979 (k = 6), A071550 (k = 8), A071551 (k = 9), A071552 (k = 10).

[Factorial(7*n)/Factorial(n)^7: n in [0..20]]; // Vincenzo Librandi, Aug 13 2014

Table[(7 n)!/(n)!^7, {n, 0, 20}] (* Vincenzo Librandi, Aug 13 2014 *)

a(n) = (7*n)!/(n!^7); \\ Andrew Howroyd, Nov 01 2018

From Peter Bala, Feb 14 2020: (Start)
a(n) = C(7*n,n)*C(6*n,n)*C(5*n,n)*C(4*n,n)*C(3*n,n)*C(2*n,n).
a(m*p^k) == a(m*p^(k-1)) ( mod p^(3*k) ) for prime p >= 5 and positive integers m and k - apply  Mestrovic, Equation 39, p. 12.
a(n) = [x^n](F(x)^(5040*n)), where F(x) = 1 + x + 62528*x^2 + 11087269661*x^3 + 3021437267047869*x^4 + 1045823730475703710735*x^5 + ...
appears to have integer coefficients. For similar results see A008979.
a(n) = [(x*y*z*u*v*w)^n] (1 + x + y + z + u + v + w)^(7*n). (End)

a(8)-a(9) added by Andrew Howroyd, Nov 01 2018

A060538 Square array read by antidiagonals of number of ways of dividing n*k labeled items into n labeled boxes with k items in each box.

Original entry on oeis.org

1, 1, 2, 1, 6, 6, 1, 20, 90, 24, 1, 70, 1680, 2520, 120, 1, 252, 34650, 369600, 113400, 720, 1, 924, 756756, 63063000, 168168000, 7484400, 5040, 1, 3432, 17153136, 11732745024, 305540235000, 137225088000, 681080400, 40320, 1, 12870

Offset: 1

Henry Bottomley, Apr 02 2001

			       1        1        1        1
       2        6       20       70
       6       90     1680    34650
      24     2520   369600 63063000

Harry J. Smith, Table of n, a(n) for n = 1..210

Subtable of A187783.
Rows include A000012, A000984, A006480, A008977, A008978 etc.
Columns include A000142, A000680, A014606, A014608, A014609 etc.
Main diagonal is A034841.

T(n,k)=(n*k)!/k!^n;
for(n=1, 6, for(k=1, 6, print1(T(n,k), ", ")); print) \\ Harry J. Smith, Jul 06 2009

T(n, k) = (nk)!/k!^n = T(n-1, k)*binomial(nk, k) = T(n-1, k)*A060539(n, k) = A060540(n, k)*A000142(k).

A071550 a(n) = (8n)!/n!^8.

Original entry on oeis.org

1, 40320, 81729648000, 369398958888960000, 2390461829733887910000000, 18975581770994682860770223800320, 171889289584866507880743491472699801600

Offset: 0

Benoit Cloitre, May 30 2002

nonn

Vincenzo Librandi, Table of n, a(n) for n = 0..100

Sequences (k*n)!/n!^k: A000984 (k = 2), A006480 (k = 3), A008977 (k = 4), A008978 (k = 5), A008979 (k = 6), A071549 (k = 7), A071551 (k = 9), A071552 (k = 10).

[Factorial(8*n)/Factorial(n)^8: n in [0..20]]; // Vincenzo Librandi, Aug 13 2014

Table[(8 n)!/(n)!^8, {n, 0, 20}] (* Vincenzo Librandi, Aug 13 2014 *)

A071551 a(n) = (9n)!/n!^9.

Original entry on oeis.org

1, 362880, 12504636144000, 1080491954750208000000, 140810154080474667338550000000, 23183587808948692737291767860055162880, 4439413043841128802009762476941510771390464000

Offset: 0

Benoit Cloitre, May 30 2002

nonn

Vincenzo Librandi, Table of n, a(n) for n = 0..100

Sequences (k*n)!/n!^k: A000984 (k = 2), A006480 (k = 3), A008977 (k = 4), A008978 (k = 5), A008979 (k = 6), A071549 (k = 7), A071550 (k = 8), A071552 (k = 10).

[Factorial(9*n)/Factorial(n)^9: n in [0..20]]; // Vincenzo Librandi, Aug 13 2014

Table[(9n)!/(n)!^9, {n, 0, 20}] (* Vincenzo Librandi, Aug 13 2014 *)

cp's OEIS Frontend

A008977 a(n) = (4*n)!/(n!)^4.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Maxima

PARI

Python

Formula

A034841 a(n) = (n^2)! / (n!)^n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A187783 De Bruijn's triangle, T(m,n) = (m*n)!/(n!^m) read by downward antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

Extensions

A008979 a(n) = (6n)!/(n!)^6.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

A023981 Sum of exponents in prime-power factorization of multinomial coefficient M(5n; n,n,n,n,n).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A082489 a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2*k,k) * C(n+3*k,k) * C(n+4*k,k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A082489 a(n) = Sum_{k = 0..n} C(n,k) * C(n+k,k) * C(n+2k,k) C(n+3k,k) C(n+4*k,k).