5765760

Appears in sequences

• Multinomial coefficients(TOP, BOTTOM), where TOP = n^2, BOTTOM = ( 1 3 5 ... 2n-1 ).at n=4A022919
• a(n) = (n+10)!/10!.at n=6A051431
• Product of 6 consecutive integers.at n=16A053625
• LCM of n-th primorial number and its Euler totient.at n=6A058251
• Denominator of the last term of the Egyptian fraction sum (using the greedy algorithm) which satisfies 1 = 1/n + 1/(n+1) + 1/(n+2) ... 1/a(n).at n=4A069257
• a(1) = 1, a(n) = a(n-1) times smallest prime factor of n.at n=13A072486
• a(n) = smallest (n+1)(n+2)...(n+k) that is >= n!.at n=9A075358
• a(n) = smallest multiple of the product of next n natural numbers which is a product of consecutive numbers starting with k+1 where k = n(n+1)/2 = the n-th triangular number.at n=3A077540
• Smallest integer value of n!/(m_1!*m_2!*...*m_k!), where 1=m_1 < m_2 < ... is the sequence of integers coprime to n.at n=15A088303
• Number of labeled plane 2-trees on n triangles.at n=6A093197
• Product of n-th row of irregular triangle defined in A093911.at n=4A093910
• a(n) is the smallest number x such that floor(sigma(sigma(x))/x) = n or the A098219(x) quotient equals n.at n=20A098221
• (Product{k|n} k$) / n$. Here '$' denotes the swinging factorial function (A056040).at n=28A163088
• The slowest growing sequence that satisfies: a(1) = 1, a(n) is a multiple of n and a(n-1), and a(n) > a(n-1).at n=13A191836
• Smallest number k such that the symmetric representation of sigma(k) has at least one part of width n.at n=35A250070
• Positions of records in A220400.at n=37A297160
• Semi-unitary perfect numbers: numbers k such that susigma(k) = 2k, where susigma(k) is the sum of the semi-unitary divisors of k (A322485).at n=11A322486
• a(n) is the least integer k such that sigma(sigma(k)) >= n*k where sigma is A000203, the sum of divisors.at n=20A327630
• Numbers k for which k * gcd(sigma(k), A003961(k)) is equal to sigma(k) * gcd(k, A003961(k)), where A003961 shifts the prime factorization one step towards larger primes, and sigma is the sum of divisors function.at n=11A349745
• Refactorable numbers (A033950) having more divisors than all smaller refactorable numbers.at n=33A359964