362880

Appears in sequences

• Sorted list of orders of Weyl groups of types A_n, B_n, D_n, E_n, F_4, G_2.at n=21A001217
• a(n) = n! if n is odd otherwise 0 (from the Taylor series for sin x).at n=9A005212
• 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=54A008279
• 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=53A008279
• Triangle of coefficients in expansion of D^n (tan x) in powers of tan x.at n=34A008293
• Triangle of coefficients in expansion of D^n (sec x) / sec x in powers of tan x.at n=29A008294
• Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) gives number of {0,1} n X n matrices with all row and column sums equal to k.at n=46A008300
• Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) gives number of {0,1} n X n matrices with all row and column sums equal to k.at n=53A008300
• Triangle read by rows: T(n,k) = number of permutations of [n] allowing i->i+j (mod n), j=0..k-1.at n=44A008305
• Triangle T(n,k) read by rows: associated Stirling numbers of first kind (n >= 2, 1 <= k <= floor(n/2)).at n=20A008306
• Second-order Eulerian triangle T(n,k), 1 <= k <= n.at n=44A008517
• a(n) = (2*n+1)!.at n=4A009445
• Smallest factorial that begins with n.at n=2A018854
• Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).at n=44A019538
• Place n distinguishable balls in n boxes (in n^n ways); let T(n,k) = number of ways that the maximum in any box is k, for 1 <= k <= n; sequence gives triangle of numbers T(n,k).at n=36A019575
• Triangle of coefficients of Laguerre polynomials n!*L_n(x) (rising powers of x).at n=45A021009
• Triangle of coefficients of Laguerre polynomials L_n(x) (powers of x in decreasing order).at n=54A021010
• Triangle of coefficients in expansion of x^n in terms of Laguerre polynomials L_n(x).at n=45A021012
• Table of orders of primitive permutation groups by degree.at n=38A023675
• 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=54A028246