2627625

Appears in sequences

• Number of partitions of { 1, 2, ..., 4n } into sets of size 4.at n=4A025036
• a(n) = (n^2)!/(n!)^(n+1); number of ways of dividing n^2 labeled items into n unlabeled boxes of n items each.at n=4A057599
• Triangle of Stirling numbers of order 4.at n=27A059023
• 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=24A060540
• a(n) = (4*n-1)! / (n! * n! * n! * (n-1)! * 3!).at n=3A082368
• a(n) is the least integer of the form (n^2)!/(n!)^k.at n=3A096126
• n!/A124900(n).at n=15A124902
• Triangle read by rows: T(n,k) = number of partitions of [1..k] into n nonempty clumps of sizes 1, 2, 3 or 4 (n >= 0, 0 <= k <= 4n).at n=43A144643
• Triangle read by rows: T(n,k) = number of partitions of [1..k] into n nonempty clumps of sizes 1, 2, 3 or 4 (n >= 0, 0 <= k <= 4n).at n=44A144643
• Number of nX1 0..3 arrays with values 0..3 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=14A199516
• Number of nX1 0..3 arrays with values 0..3 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=15A199516
• 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=47A200473
• Greatest 5th-power-free divisor of n!.at n=15A248769
• a(n) = (m(n)*n)! / (n!)^(m(n)+1), where m(n) is the largest prime power <= n.at n=3A263884
• Triangle read by rows, expansion of e.g.f. exp(x*(cos(z) + cosh(z) - 2)/2), nonzero coefficients of z.at n=14A291452
• Coefficients of the Omega polynomials of order 4, triangle T(n,k) read by rows with 0<=k<=n.at n=14A318148
• Coefficients of polynomials related to ordered set partitions. Triangle read by rows, T_{m}(n, k) for m = 4 and 0 <= k <= n.at n=14A326585
• Irregular triangle read by rows in which the n-th row lists multinomials for partitions of 4n which have only parts which are multiples of 4, in Hindenburg order.at n=11A327004
• 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=40A361948
• Expansion of e.g.f. exp( Sum_{k>=0} x^(5*k+4) / (5*k+4)! ).at n=16A365895