305540235000
domain: N
Appears in sequences
- a(n) = (5*n)!/(n!)^5.at n=4A008978
- a(n) = (4n)!/(24^n).at n=5A014608
- 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.at n=32A060538
- Table T(n,k), 0<=k, 0<=n, read by antidiagonals, defined by T(n,k) = (k*n)! / (n!)^k.at n=49A089759
- Triangle t(n,m) = (n*m)!/(m!^n) read by rows, 0<=m<=n.at n=19A141906
- Number of 4*n X n 0..1 arrays with row sums 4 and column sums 16.at n=4A172578
- Number of 5*n X 20 0..1 arrays with row sums 4 and column sums n.at n=0A172588
- Number of 5*n X 20 0..2 arrays with row sums 4 and column sums n.at n=0A172691
- Number of 5*n X 20 0..3 arrays with row sums 4 and column sums n.at n=0A172785
- Number of 5*n X 20 0..4 arrays with row sums 4 and column sums n.at n=0A172847
- Number of permutations of 4 copies of 1..n avoiding adjacent step pattern up, up, up, up, up.at n=5A177656
- Number of permutations of 4 copies of 1..n avoiding adjacent step pattern up, down, down, down, down, down.at n=5A177657
- Number of permutations of 4 copies of 1..n avoiding adjacent step pattern up, up, up, up, up, up.at n=5A177676
- Greatest 5th-power-free divisor of n!.at n=19A248769
- Triangle read by rows, coefficients of the polynomials P(m, n) = Sum_{k=1..n} binomial(m*n, m*k)* P(m, n-k)*z with P(m, 0) = 1 and m = 4.at n=20A278074
- Ordered set partitions of the set {1, 2, ..., 4*n} with all block sizes divisible by 4, irregular triangle T(n, k) for n >= 0 and 0 <= k < A000041(n), read by rows.at n=18A327024
- Expansion of e.g.f. 1 / ( 1 - Sum_{k>=0} x^(5*k+4) / (5*k+4)! ).at n=20A365914
- Number of maximal chains in the poset of n-ary words of length n ordered by B covers A iff A_i <= B_i for 1 <= i <= n.at n=5A377135