168168000

Appears in sequences

• a(n) = (5*n)!/(n!)^5.at n=3A008978
• a(n) = (3n)!/(6^n).at n=5A014606
• 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=25A060538
• Table T(n,k), 0<=k, 0<=n, read by antidiagonals, defined by T(n,k) = (k*n)! / (n!)^k.at n=39A089759
• Denominators used in A090219 to compute formula for column sequences of array A078741.at n=15A090220
• Triangle t(n,m) = (n*m)!/(m!^n) read by rows, 0<=m<=n.at n=18A141906
• Number of 3*n X n 0..1 arrays with row sums 4 and column sums 12.at n=4A172567
• Number of 5*n X 15 0..1 arrays with row sums 3 and column sums n.at n=0A172590
• Number of 5*n X 15 0..2 arrays with row sums 3 and column sums n.at n=0A172693
• Number of 5*n X 15 0..3 arrays with row sums 3 and column sums n.at n=0A172784
• Number of permutations of 3 copies of 1..n with all adjacent differences <= 4 in absolute value.at n=5A177294
• Number of permutations of 3 copies of 1..n with all adjacent differences <= 5 in absolute value.at n=5A177295
• Number of permutations of 3 copies of 1..n with all adjacent differences <= 6 in absolute value.at n=5A177296
• Number of permutations of 3 copies of 1..n with all adjacent differences <= 7 in absolute value.at n=5A177297
• Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, up, up, up, up.at n=5A177615
• Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, down, down, down, down, down.at n=5A177616
• Number of permutations of 3 copies of 1..n avoiding adjacent step pattern up, up, up, up, up, up.at n=5A177635
• Number of permutations of 1..n with the sequence of sums of 4 adjacent elements having exactly 2 maxima.at n=7A179721
• De Bruijn's triangle, T(m,n) = (m*n)!/(n!^m) read by downward antidiagonals.at n=41A187783
• Triangle read by rows: T(n,k) is the number of compositions of set {1, 2, ..., k} into exactly n blocks, each of size 1, 2 or 3 (n >= 0, 0 <= k <= 3*n).at n=49A189804