1816214400

Appears in sequences

• a(n) = (3n)!/(3!n!).at n=4A001525
• a(n) = n!/6!.at n=9A001730
• a(n) = binomial(n,2)!/n!.at n=3A006473
• Triangle of numbers where k-th row contains (ij)!/(i!j!) with i+j = k+1, 1 <= i <= k.at n=23A046792
• Triangle of numbers where k-th row contains (ij)!/(i!j!) with i+j = k+1, 1 <= i <= k.at n=25A046792
• a(n) = Product_{k=1..n} rad(k), where rad(n) is the product of distinct prime factors of n, cf. A007947.at n=14A048803
• If n = p_1^a_1 * p_2^a_2 * p_3^a_3 * ..., where p_k is the k-th prime and the a's are nonnegative integers, then a(n) = n!/product_{k >= 1} [(p_k)!^a_k].at n=15A056218
• Number of degree-n even permutations of order exactly 8.at n=13A061134
• n! divided by product of factorials of all proper divisors of n, as n runs through the values for which the result is an integer.at n=14A075071
• a(1) = 1; for n > 1, a(n) = n! divided by product of factorials of all prime divisors of n.at n=14A075072
• Erroneous version of A056218.at n=14A075080
• Triangle read by rows in which n-th row gives all values of n!/{(p!)^a*(q!)^b*(r!)^c*...} (in increasing order) for all factorizations n = p^a*q^b*r^c*....at n=25A075377
• Table of graphs with n (>=0) nodes and k (>=0) edges. Each type of object labeled from its own label set.at n=35A091478
• Triangle T(n,k) = n!/(k!*(n-3*k)!), for n >= 3*k >= 0, read by rows.at n=44A118394
• Number triangle (3n)!/(3k)!.at n=17A119831
• Small factors of some highly composite numbers.at n=31A161894
• a(n) = (5*n)!/(2*n)!.at n=3A166384
• Number of multiset permutations of the n initial elements of A005229 with additional element A005229(0)=1.at n=13A169638
• Largest highly abundant number with n distinct prime factors.at n=6A225194
• Denominators in expansion of 1/(1-log(1+x)).at n=14A226933