181440

Appears in sequences

• Order of alternating group A_n, or number of even permutations of n letters.at n=9A001710
• a(n) = (n+1) * (2*n)! / n!.at n=5A002690
• Triangle T(n,k) = n!/(n-k)! (0 <= k <= n) read by rows, giving number of permutations of n things k at a time.at n=52A008279
• Order of shuffle group on n cards {0..n-1} generated by i->n-1-i and i->min{2i,2n-1-2i}.at n=8A014767
• Numbers k such that sigma(k) >= 4*k.at n=30A023198
• Table of orders of primitive permutation groups by degree.at n=37A023675
• Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.at n=43A028246
• Triangle giving number of labeled trees with n >= 3 nodes and diameter d >= 2.at n=27A034854
• Maximum of different products of partitions of n into distinct parts.at n=42A034893
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*4^j.at n=31A038222
• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*3^j.at n=32A038233
• Triangle read by rows, the Bell transform of (n+2)!/2 without column 0.at n=28A046089
• Nonsingular n X n matrices over GF(4).at n=3A053291
• Number of k-simplices in the first derived complex of the standard triangulation of an n-simplex. Equivalently, T(n,k) is the number of ascending chains of length k+1 of nonempty subsets of the set {1, 2, ..., n+1}.at n=34A053440
• Number of different solutions to problem in A054961.at n=9A054962
• Triangle T(n,k) read by rows: number of labeled trees with n nodes and k leaves, n >= 2, 2 <= k <= n.at n=28A055314
• Triangle n!/(n-k), 1 <= k < n, read by rows.at n=34A058298
• Triangle read by rows. T(n, k) = Sum_{i=0..n} Stirling2(n, i)*Product_{j=1..k} (i - j + 1) for 0 <= k <= n.at n=43A059098
• Triangle T(n,k) arising from enumeration of permutations with ordered orbits, read by rows (1<=k<=n).at n=36A059418
• Least number whose number of divisors is n-th term from A014613 (numbers of form p*q*r*s, products of exactly 4 primes, counted with multiplicity).at n=17A061218