488864376

Appears in sequences

• Number of partitions of { 1, 2, ..., 5n } into sets of size 5.at n=4A025037
• a(n) = 42*(n+1) * binomial(n+5,10).at n=12A027815
• Triangle of Stirling numbers of order 5.at n=33A059024
• 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=31A060540
• a(n) = (4*n-1)! / (n! * n! * n! * (n-1)! * 3!).at n=4A082368
• 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=18A199516
• 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=19A199516
• Triangle read by rows, expansion of the e.g.f. given below related to partitions of {1,2,...,5n} into sets of size 5, nonzero coefficients of z.at n=14A318257
• Coefficients of polynomials related to ordered set partitions. Triangle read by rows, T_{m}(n, k) for m = 5 and 0 <= k <= n.at n=14A326717
• 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=49A361948
• Expansion of e.g.f. exp( Sum_{k>=0} x^(4*k+5) / (4*k+5)! ).at n=20A365898