2546168625
domain: N
Appears in sequences
- Number of partitions of { 1, 2, ..., 4n } into sets of size 4.at n=5A025036
- 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=32A060540
- Triangle read by rows, expansion of e.g.f. exp(x*(cos(z) + cosh(z) - 2)/2), nonzero coefficients of z.at n=20A291452
- Coefficients of the Omega polynomials of order 4, triangle T(n,k) read by rows with 0<=k<=n.at n=20A318148
- a(0) = 1 and a(n) = (5*n)!/(5!*n!^5) for n > 0.at n=4A322252
- 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=20A326585
- 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=18A327004
- 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=50A361948
- Expansion of e.g.f. exp( Sum_{k>=0} x^(5*k+4) / (5*k+4)! ).at n=20A365895