12441600
domain: N
Appears in sequences
- Product of consecutive factorials.at n=18A034882
- a(n) = phi(n!!) where phi is the Euler totient function. In other words, a(n) = A000010(A006882(n)).at n=16A129335
- Sorted number of edges of distinct solutions in the mix of regular convex polyhedra.at n=25A199546
- Numbers of the form i^j * j^k * k^i, where i,j,k > 1.at n=33A259406
- Partial products of A061017.at n=12A282165
- Minimum value of Product_{i in lambda} i!, where lambda ranges over all partitions of n into distinct parts.at n=19A290518
- a(n) = Product_{k=0..n} (n + k)!.at n=3A296591
- If n = Sum (2^e_k) then a(n) = Product ((e_k + 2)!).at n=30A309841
- Numbers that can be written as a product of two or more consecutive factorial numbers.at n=11A334174
- Triangle read by rows: T(n,k) = Product_{i=n-k+1..n} i! for 0 <= k <= n.at n=25A335997
- Numbers m > 1 such that for all k > 1, m can be written as a product of factorials without using k!.at n=25A359751