8648640

Appears in sequences

• a(n) = (2*n+1)! / n!.at n=6A000407
• a(n) = n!/6!.at n=7A001730
• Superabundant [or super-abundant] numbers: n such that sigma(n)/n > sigma(m)/m for all m < n, sigma(n) being A000203(n), the sum of the divisors of n.at n=36A004394
• a(1)=1; for n > 1, a(n) is the smallest number with the same number of divisors as 2*a(n-1).at n=26A019505
• Partial products of the sequence of prime powers (A000961).at n=9A024923
• Triangle of numbers where k-th row contains (ij)!/(i!j!) with i+j = k+1, 1 <= i <= k.at n=34A046792
• Triangle of numbers where k-th row contains (ij)!/(i!j!) with i+j = k+1, 1 <= i <= k.at n=29A046792
• 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=14A056218
• Fourth (unsigned) column of triangle A062138 (generalized a=5 Laguerre).at n=5A062150
• Smallest number whose square is divisible by n!.at n=14A065887
• Smallest n-digit number with A066150(n) divisors.at n=6A066151
• Largest n-digit number with maximal number of divisors.at n=6A069650
• Least k such that n*prime(k) <= k*tau(k).at n=24A073066
• Product of prime(n) consecutive numbers starting from prime(n).at n=3A075069
• 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=13A075071
• a(1) = 1; for n > 1, a(n) = n! divided by product of factorials of all prime divisors of n.at n=13A075072
• Erroneous version of A056218.at n=13A075080
• 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=23A075377
• Numbers k such that sigma(k)/k >= sigma(m)/m for all m <= k.at n=37A077006
• a(n) = n! / floor(n/2)!.at n=13A081125