2858856

Appears in sequences

• Number of partitions of { 1, 2, ..., 6n } into sets of size 6.at n=3A025038
• Triangle of Stirling numbers of order 6.at n=20A059025
• Square array read by antidiagonals downwards: T(n,k) = (n*k)!/(k!^n*n!), (n>=1, k>=1), the number of ways of dividing nk labeled items into n unlabeled boxes with k items in each box.at n=30A060540
• a(n) = (1/6)*multinomial(3*n;n,n,n).at n=5A060542
• Triangle read by rows: T(n,k) = number of partitions of [1..k] into n nonempty clumps of sizes 1, 2, 3, 4, 5 or 6 (n >= 0, 0 <= k <= 6n).at n=37A151359
• Triangle read by rows: T(n,k) = number of partitions of [1..k] into n nonempty clumps of sizes 1, 2, 3, 4, 5 or 6 (n >= 0, 0 <= k <= 6n).at n=38A151359
• Number of nX1 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and every element equal to two or fewer horizontal or vertical neighbors.at n=16A199094
• Number of nX1 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and every element equal to two or fewer horizontal or vertical neighbors.at n=17A199094
• Irregular triangle read by rows: T(n,k) = number of ways to assign n people to d_k unlabeled groups of equal size (where d_k is the k-th divisor of n).at n=54A200473
• Irregular triangle read by rows in which the n-th row lists multinomials for partitions of 3n which have only parts which are multiples of 3, in Hindenburg order.at n=26A327003
• a(n) = Sum_{k = 0..n-1} (-1)^k*binomial(n,k)*binomial(n-1,k)^2.at n=12A361710
• Array read by ascending antidiagonals. A(n, k) = Product_{j=0..k-1} binomial((j + 1)*n - 1, n - 1) if n >= 1, and A(0, k) = 1 for all k.at n=48A361948