A008979 -id:A008979 - 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

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

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

Original entry on oeis.org

0, 7, 13, 20, 21, 29, 33, 40, 37, 40, 43, 54, 51, 59, 64, 67, 60, 69, 67, 76, 75, 79, 85, 95, 88, 91, 96, 96, 93, 102, 102, 111, 101, 104, 108, 114, 106, 115, 121, 125, 118, 130, 130, 143, 142, 140, 146, 155, 144, 147, 148, 153, 151, 159, 157, 162, 155, 159, 164, 177, 170, 180, 186

Offset: 0

Clark Kimberling

nonn

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

Cf. A001222, A008979, A022559.

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

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

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

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

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

A001421 a(n) = (6n)!/((n!)^3(3*n)!).

Original entry on oeis.org

1, 120, 83160, 81681600, 93699005400, 117386113965120, 155667030019300800, 214804163196079142400, 305240072216678400087000, 443655767845074392936328000, 656486312795713480715743268160, 985646873056680684690542988249600, 1497786250388951255453847206769124800

Offset: 0

N. J. A. Sloane, Glenn K Painter (KUPK78A(AT)prodigy.com)

nonn

Self-convolution of A092870, where A092870(n) = (12^n/n!^2) * Product_{k=0..n-1} (12k+1)*(12k+5). - Paul D. Hanna, Jan 25 2011

			G.f.: A(x) = 1 + 120*x + 83160*x^2 + 81681600*x^3 + ...
A(x)^(1/2) = 1 + 60*x + 39780*x^2 + 38454000*x^3 + ... + A092870(n)*x^n + ...

Seiichi Manyama, Table of n, a(n) for n = 0..310 (terms 0..75 from Vincenzo Librandi)
Timothy Huber, Daniel Schultz, and Dongxi Ye, Ramanujan-Sato series for 1/pi, Acta Arith. (2023) Vol. 207, 121-160. See p. 11.
M. Kaneko and D. Zagier, Supersingular j-invariants, hypergeometric series and Atkin's orthogonal polynomials, pp. 97-126 of D. A. Buell and J. T. Teitelbaum, eds., Computational Perspectives on Number Theory, Amer. Math. Soc., 1998 (See Eq. 31.)
R. S. Maier, Nonlinear differential equations satisfied by certain classical modular forms, arXiv:0807.1081 [math.NT], 2008_2010, p. 34 equation (7.29b).
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. A092870; variants: A184423, A008977, A184892, A184896, A184898. - Paul D. Hanna, Jan 25 2011
Cf. A289292.
Cf. A145492, A145493, A145494, A008979.

[Factorial(6*n)/(Factorial(n)^3*Factorial(3*n)): n in [0..15]]; // Vincenzo Librandi, Oct 26 2011

Maple
```
f := n->(6*n)!/( (n!)^3*(3*n)!);
```

Factorial[6 n]/(Factorial[3n] Factorial[n]^3) (* Jacob Lewis (jacobml(AT)uw.edu), Jul 28 2009 *)
a[ n_] := SeriesCoefficient[ HypergeometricPFQ[ {1/6, 1/2, 5/6}, {1, 1}, 1728 x], {x, 0, n}] (* Michael Somos, Jul 11 2011 *)

{a(n)=(2*n)!/n!^2*(12^n/n!^2)*prod(k=0, n-1, (6*k+1)*(6*k+5))} \\ Paul D. Hanna, Jan 25 2011

O.g.f.: Hypergeometric2F1(5/12, 1/12; 1; 1728x)^2. - Jacob Lewis (jacobml(AT)uw.edu), Jul 28 2009
a(n) = binomial(2n,n) * (12^n/n!^2) * Product_{k=0..n-1} (6k+1)*(6k+5). - Paul D. Hanna, Jan 25 2011
G.f.: F(1/6, 1/2, 5/6; 1, 1; 1728*x), a hypergeometric series. - Michael Somos, Feb 28 2011
0 = y^3*z^3 - 360*y^4*z^2 + 43200*y^5*z - 1728000*y^6 - 16632*x*y^2*z^3 + 7691328*x*y^3*z^2 - 1738520064*x*y^4*z + 176027074560*x*y^5 + 92207808*x^2*y*z^3 - 69176553984*x^2*y^2*z^2 + 23624298528768*x^2*y^3*z - 2853152143441920*x^2*y^4 - 170400029184*x^3*z^3 + 224945232150528*x^3*y*z^2 - 92759146352345088*x^3*y^2*z + 11686511179538104320*x^3*y^3 where x = a(n), y = a(n+1), z = a(n+2) for all n in z. - Michael Somos, Sep 21 2014
a(n) ~ 2^(6*n - 1) * 3^(3*n) / (Pi^(3/2) * n^(3/2)). - Vaclav Kotesovec, Apr 07 2018
From Peter Bala, Feb 14 2020: (Start)
a(n) = binomial(6*n,n)*binomial(5*n,n)*binomial(4*n,n) = ( [x^n](1 + x)^(6*n) ) * ( [x^n](1 + x)^(5*n) ) * ( [x^n](1 + x)^(4*n) ) = [x^n](F(x)^(120*n)), where F(x) = 1 + x + 227*x^2 + 123980*x^3 + 92940839*x^4 + 82527556542*x^5 + 81459995686401*x^6 + ...
appears to have integer coefficients. For similar results see A008979.
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)^(6*n). (End)
a(n) = (8^n/n!^3)*Product_{k = 0..3*n-1} (2*k + 1). - Peter Bala, Feb 26 2023
a(n) = 24*(6*n - 1)*(2*n - 1)*(6*n - 5)*a(n-1)/n^3. - Neven Sajko, Jul 19 2023
From Karol A. Penson, Jan 21 2025: (Start)
a(n) = Integral_{x=0..1728} x^n*W(x), with W(x) =  W1(x) + W2(x) + W3(x), where
  W1(x) = hypergeometric([1/6, 1/6, 1/6], [1/3, 2/3], x/1728)/(6*sqrt(Pi)*x^(5/6)*Gamma(5/6)^3),
  W2(x) = - hypergeometric([1/2, 1/2, 1/2], [2/3, 4/3], x/1728)/(24*Pi^2*sqrt(x)), and
  W3(x) = hypergeometric([5/6, 5/6, 5/6], [4/3, 5/3], x/1728)*Gamma(5/6)^3/(1536*Pi^(7/2)*x^(1/6)). This integral representation is unique as W(x) is the solution of the Hausdorff power moment problem on x = (0, 1728). Using only the definition of a(n), W(x) can be proven to be positive. W(x) is singular at x = 0, with singularity x^(-1/6), and for x > 0 is monotonically decreasing to zero at x = 1728. (End)

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

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 *)

A071552 a(n) = (10n)!/n!^10.

Original entry on oeis.org

1, 3628800, 2375880867360000, 4386797336285844480000000, 12868639981414579848070084500000000, 49120458506088132224064306071170476903628800

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), A071551 (k = 9).

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

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

A229049 G.f.: Sum_{n >= 0} (6n)!/n!^6 x^n / (1-x)^(6*n+1).

Original entry on oeis.org

1, 721, 7489441, 137322405361, 3249278494922881, 88913838899388373921, 2672932604015450235911761, 85821373873727899097881489201, 2892941442791065880984595547275841, 101239016762863657789924022384195015281, 3649717311362112161867915447690005522733041

Offset: 0

Paul D. Hanna, Sep 22 2013

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

			G.f.: A(x) = 1 + 721*x + 7489441*x^2 + 137322405361*x^3 + 3249278494922881*x^4 +...
where
A(x) = 1/(1-x) + (6!/1!^6)*x/(1-x)^7 + (12!/2!^6)*x^2/(1-x)^13 + (18!/3!^6)*x^3/(1-x)^19 + (24!/4!^6)*x^4/(1-x)^25 + (30!/5!^6)*x^5/(1-x)^31 +...
Equivalently,
A(x) = 1/(1-x) + 720*x/(1-x)^7 + 7484400*x^2/(1-x)^13 + 137225088000*x^3/(1-x)^19 + 3246670537110000*x^4/(1-x)^25 + 88832646059788350720*x^5/(1-x)^31 +...+ A008979(n)*x^n/(1-x)^(6*n+1) +...

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

Cf. A008979, A001850, A081798, A082488, A082489, A229050.

Column k = 6 of A229142.

with(combinat):
a:= n-> add(multinomial(n+5*k, n-k, k$6), 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]*Binomial[n+5*k,k], {k, 0, n}],{n,0,20}] (* Vaclav Kotesovec, Sep 23 2013 *)

{a(n)=polcoeff(sum(m=0, n, (6*m)!/m!^6*x^m/(1-x+x*O(x^n))^(6*m+1)), n)}
for(n=0,15,print1(a(n),", "))

{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)*binomial(n+5*k,k))}
for(n=0,15,print1(a(n),", "))

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) * C(n+5*k,k).
Recurrence: n^5*(2*n - 5)*(2*n - 3)*(3*n - 10)*(3*n - 7)*(3*n - 5)*(3*n - 4)*(6*n - 25)*(6*n - 19)*(6*n - 13)*(6*n - 7)*a(n) = (2*n - 5)*(3*n - 10)*(3*n - 7)*(6*n - 25)*(6*n - 19)*(6*n - 13)*(6*n - 5)*(839916*n^8 - 6159384*n^7 + 18804591*n^6 - 30967129*n^5 + 29803190*n^4 - 16984623*n^3 + 5534242*n^2 - 929843*n + 60482)*a(n-1) - (3*n - 10)*(6*n - 25)*(6*n - 19)*(58320*n^12 - 1030320*n^11 + 7973640*n^10 - 35550360*n^9 + 101096973*n^8 - 191892891*n^7 + 247426961*n^6 - 216687345*n^5 + 127127767*n^4 - 48662719*n^3 + 11593839*n^2 - 1535715*n + 84350)*a(n-2) + 10*(6*n - 25)*(6*n - 1)*(23328*n^13 - 618192*n^12 + 7344432*n^11 - 51616440*n^10 + 238504338*n^9 - 761904909*n^8 + 1722993100*n^7 - 2778206390*n^6 + 3175831572*n^5 - 2526793076*n^4 + 1352618106*n^3 - 459806772*n^2 + 89082095*n - 7435050)*a(n-3) - 5*(3*n - 1)*(6*n - 7)*(6*n - 1)*(11664*n^12 - 369360*n^11 + 5235192*n^10 - 43777800*n^9 + 239670873*n^8 - 901183065*n^7 + 2374616540*n^6 - 4392523494*n^5 + 5622136222*n^4 - 4816276070*n^3 + 2596763070*n^2 - 784074950*n + 100205500)*a(n-4) + (2*n - 1)*(3*n - 4)*(3*n - 1)*(6*n - 13)*(6*n - 7)*(6*n - 1)*(648*n^9 - 19548*n^8 + 256338*n^7 - 1909293*n^6 + 8851093*n^5 - 26285080*n^4 + 49492875*n^3 - 56141750*n^2 + 34024625*n - 8063750)*a(n-5) - (n-5)^5*(2*n - 3)*(2*n - 1)*(3*n - 7)*(3*n - 4)*(3*n - 2)*(3*n - 1)*(6*n - 19)*(6*n - 13)*(6*n - 7)*(6*n - 1)*a(n-6). - Vaclav Kotesovec, Sep 23 2013
a(n) ~ c*d^n/(n^(5/2)), where d = 46661.9996785484656481246... is the root of the equation 1 - 6*d + 15*d^2 - 20*d^3 + 15*d^4 - 46662*d^5 + d^6 = 0 and c = 0.024758197509539176365175770882978221... - Vaclav Kotesovec, Sep 23 2013
exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + x + 361*x^2 + 2496841*x^3 + 34333162981*x^4 + ... appears to have integer coefficients. - Peter Bala, Jan 13 2016

A367570 a(n) = Product_{k=0..n} (6*k)! / k!^6.

Original entry on oeis.org

1, 720, 5388768000, 739474163011584000000, 2400828978003787120431882240000000000, 213271990853093812884314351984207293234859212800000000000, 569474121824212834327144127568532894901251393782268174537457286512640000000000000

Offset: 0

Vaclav Kotesovec, Nov 23 2023

nonn

Cf. A000178, A008979, A271946.

Cf. A007685, A367567, A367568, A367569, A367571.

Table[Product[(6*k)!/k!^6, {k, 0, n}], {n, 0, 10}]
Table[Product[Binomial[6*k,k] * Binomial[5*k,k] * Binomial[4*k,k] * Binomial[3*k,k] * Binomial[2*k,k], {k, 0, n}], {n, 0, 10}]

a(n) = Product_{k=0..n} binomial(6*k,k) * binomial(5*k,k) * binomial(4*k,k) * binomial(3*k,k) * binomial(2*k,k).
a(n) = A271946(n) / A000178(n)^6.
a(n) ~ A^(35/6) * Gamma(1/3)^(5/3) * 2^(3*n^2 + n - 215/72) * 3^(3*n^2 + 7*n/2 + 47/72) * exp(5*n/2 - 35/72) / (n^(5*n/2 + 125/72) * Pi^(5*n/2 + 10/3)), where A is the Glaisher-Kinkelin constant A074962.

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

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

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

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A001421 a(n) = (6*n)!/((n!)^3*(3*n)!).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

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

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

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

Views

A001421 a(n) = (6n)!/((n!)^3(3*n)!).

A229049 G.f.: Sum_{n >= 0} (6n)!/n!^6 x^n / (1-x)^(6*n+1).