8709120
domain: N
Appears in sequences
- a(n) = (A005867(n+1) - A000165(n))/96.at n=9A065412
- a(1) = 1 and a(n+1) = smallest multiple of a(n) beginning in (n+1).at n=7A077517
- Triangle read by rows: T(n,m) = number of 3-uniform T_0-hypergraphs with n distinct edges and m vertices(n>=3, 1<=m<=2*n+1).at n=24A093854
- Cumulative product of quintuple factorial A085157.at n=9A114790
- Product of the nonzero digital products of all the numbers 1 to n (a 'total digital-product factorial' in base 10).at n=13A131451
- Array read by antidiagonals: T(n,k) = (k+1)^n*(n+k)!.at n=41A154120
- a(n) = Product_{k=0..n} (k^2)!.at n=3A255322
- a(n) is the minimal product of a positive integer sequence of length n with no duplicate substrings of length greater than 1, and every number different from its neighbors.at n=19A282169
- a(n) = Product_{k=0..n} (5*k + 4)!.at n=1A294326
- Integers that are the product of two factorials A000142.at n=35A349424
- Numbers m > 1 such that for all k > 1, m can be written as a product of factorials without using k!.at n=23A359751
- Numbers with a record number of proper factorizations for which the sum of the squares of the factors is a square.at n=31A379926
- Numbers k such that there exist three numbers x, y and z such that k = psi(x) = psi(y) = psi(z) = x + y + z.at n=27A387290