24883200

Appears in sequences

• Superfactorials: product of first n factorials.at n=6A000178
• Product of consecutive factorials.at n=19A034882
• 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=30A066121
• Triangle, read by rows: T(0,0) = 1; T(n,k) = n!*T(n-1,k) - T(n-1,k-1).at n=21A107415
• 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=28A135185
• Determinants of the n X n matrices whose (i,j)-elements are lcm(i^2, j^2).at n=4A140412
• A triangle of q factorial type based on Stirling first polynomials: t(n,k)=If[m == 0, n!, Product[Sum[(-1)^(i + k)*StirlingS1[k - 1, i]*(m + 1)^i, {i, 0, k - 1}], {k, 1, n}]].at n=34A156588
• The multiplicative Wiener index of the rooted tree with Matula-Goebel number n.at n=23A196061
• The multiplicative Wiener index of the rooted tree with Matula-Goebel number n.at n=31A196061
• Product of the digits of the n-th Fibonacci number.at n=55A246558
• a(n) = phi(n!)/phi(n).at n=11A273060
• The number of positive integer sequences of length n with no duplicate substrings of length greater than 1 and a minimal sum (= A259280(n)).at n=22A283558
• Minimum value of Product_{i in lambda} i!, where lambda ranges over all partitions of n into distinct parts.at n=20A290518
• Minimum value of Product_{i in lambda} i!, where lambda ranges over all partitions of n into distinct parts.at n=21A290518
• a(n) = BarnesG(2*n).at n=4A296607
• a(n) = BarnesG(4*n).at n=2A296627
• If n = Sum (2^e_k) then a(n) = Product ((e_k + 2)!).at n=31A309841
• Numbers that can be written as a product of two or more consecutive factorial numbers.at n=12A334174
• Triangle read by rows: T(n,k) = Product_{i=n-k+1..n} i! for 0 <= k <= n.at n=26A335997
• Triangle read by rows: T(n,k) = Product_{i=n-k+1..n} i! for 0 <= k <= n.at n=27A335997