1152000

Appears in sequences

• Floor-factorial numbers: a(n) = Product_{k=1..n} floor(n/k).at n=20A010786
• Triangle giving a(n,k) = number of k-colored labeled graphs with n nodes.at n=17A046860
• Terminal point of a repeated reduction of usigma starting at 2^n.at n=14A146891
• Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} for which the number of j < ceiling(n/2) such that p(j) + p(n+1-j) = n+1 is equal to k (n>=1; 0<=k <=ceiling(n/2)).at n=35A155517
• Number of 3-colored graphs on n labeled nodes.at n=5A213442
• Triangle read by rows: coefficients T(n,k) of a binomial decomposition of n^n as Sum(k=0..n)T(n,k)*binomial(n,k).at n=49A244120
• Numbers k such that A001414(k) and A001414(A004086(k)) are twin primes p, p+2.at n=14A337047
• Number of diagonalized cyclic diagonal Latin squares of order 2n+1 with the first row in order.at n=5A372923
• a(n) = n*n! / Product_{k=1..n} radical(k), where radical(n) is the product of distinct prime factors of n, cf. A007947.at n=25A387151