125411328000
domain: N
Appears in sequences
- Superfactorials: product of first n factorials.at n=7A000178
- Multi-level factorials: triangle with a(n,k)=a(n-1,k-1)*a(n-1,k) but with a(n,1)=n and a(n,n)=1.at n=38A066121
- a(n) = n!/A093888(n).at n=19A093889
- Triangle, read by rows: T(0,0) = 1; T(n,k) = n!*T(n-1,k) - T(n-1,k-1).at n=28A107415
- Triangle read by rows: E. F. Cornelius Jr. and Phill Schultz-based polynomials for the D_n Cartan Matrices in sequence A129862 that give a triangular sequence.at n=36A135185
- Triangle read by rows: coefficients of polynomials defined by recursion p(x,n)=(x-Gamma(n))*p(x,n-1).at n=36A136457
- a(n) = exp(-Sum_{k=1..n} Sum_{d|k, d prime} moebius(d)*log(k/d)).at n=20A205957
- A205957(n) where n is a nonprime number.at n=11A216152
- Triangle read by rows: T(n,k) = coefficient of x^(n-k) in Product_{m=0..n-1} (x+(-1)^m*m!), 0 <= k <= n.at n=44A260612
- Product_{k=0..prime(n)} k!.at n=3A280734
- Minimum value of Product_{i in lambda} i!, where lambda ranges over all partitions of n into distinct parts.at n=27A290518
- Minimum value of Product_{i in lambda} i!, where lambda ranges over all partitions of n into distinct parts.at n=28A290518
- a(n) = BarnesG(3*n).at n=3A296608
- Numbers that can be written as a product of two or more consecutive factorial numbers.at n=18A334174
- Triangle read by rows: T(n,k) = Product_{i=n-k+1..n} i! for 0 <= k <= n.at n=34A335997
- Triangle read by rows: T(n,k) = Product_{i=n-k+1..n} i! for 0 <= k <= n.at n=35A335997
- Triangle read by rows. Row n gives the coefficients of Product_{k=0..n} (x - k!) expanded in decreasing powers of x, with row 0 = {1}.at n=44A355540
- Number of permutations of [n] having the maximal possible number of pairs of integers i<j in [n] such that their cycle minima have opposite sorting order.at n=36A381531