137225088000
domain: N
Appears in sequences
- a(n) = (6n)!/(n!)^6.at n=3A008979
- a(n) = (3n)!/(6^n).at n=6A014606
- 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=33A060538
- Table T(n,k), 0<=k, 0<=n, read by antidiagonals, defined by T(n,k) = (k*n)! / (n!)^k.at n=48A089759
- Denominators used in A090219 to compute formula for column sequences of array A078741.at n=18A090220
- Triangle t(n,m) = (n*m)!/(m!^n) read by rows, 0<=m<=n.at n=24A141906
- Number of 3*n X n 0..1 arrays with row sums 5 and column sums 15.at n=5A172561
- Number of 6*n X 18 0..1 arrays with row sums 3 and column sums n.at n=0A172600
- Number of 6*n X 18 0..2 arrays with row sums 3 and column sums n.at n=0A172704
- Number of 6*n X 18 0..3 arrays with row sums 3 and column sums n.at n=0A172793
- Number of permutations of 3 copies of 1..n with all adjacent differences <= 5 in absolute value.at n=6A177295
- Number of permutations of 3 copies of 1..n with all adjacent differences <= 6 in absolute value.at n=6A177296
- Number of permutations of 3 copies of 1..n with all adjacent differences <= 7 in absolute value.at n=6A177297
- Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, up, up, up, up, up.at n=6A177635
- 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 = 3.at n=27A278073
- Generalized Worpitzky numbers W_{m}(n,k) for m = 3, n >= 0 and 0 <= k <= n, triangle read by rows.at n=27A318260
- T(n, k) = (m*n)!/(k!*(n-k)!)^m with m = 3; triangle read by rows, 0 <= k <= n.at n=24A320824
- Ordered set partitions of the set {1, 2, ..., 3*n} with all block sizes divisible by 3, irregular triangle T(n, k) for n >= 0 and 0 <= k < A000041(n), read by rows.at n=29A327023
- T(m,n) is the number of linear extensions of n fork-join DAGs of width m, read by downward antidiagonals.at n=29A357297