294053760

Appears in sequences

• 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=32A019505
• Smallest number with 2^n divisors.at n=10A037992
• a(1) = 1; a(n) = n*a(n-1) if n does not divide a(n-1), otherwise a(n) = a(n-1).at n=16A066616
• a(1) = 1; a(n) = n*a(n-1) if n does not divide a(n-1), otherwise a(n) = a(n-1).at n=17A066616
• Highly composite numbers k such that 2*k is not a highly composite number.at n=22A073771
• Smallest highly composite number of the form k*a(n-1) where k is an integer greater than 1.at n=15A133411
• Least number k such that tau(tau(k)) = n.at n=10A193987
• List of highly composite numbers (A002182) with an exponent in its prime factorization that is at least as great as the number of positive exponents; intersection of A002182 and A212165.at n=29A212169
• Numbers n such that there are five distinct triples (k, k+n, k+2n) of squares.at n=1A214155
• Numbers k such that sigma(k) > 5*k.at n=8A215264
• Numbers n such that there are four distinct triples (k, k+n, k+2n) of squares.at n=23A222155
• Numbers n having a proper divisor d such that sigma(n) - k*d = k*n. Case k = 5.at n=0A291459
• Bi-unitary superabundant numbers: numbers n such that bsigma(n)/n > bsigma(m)/m for all m < n, where bsigma is the sum of the bi-unitary divisors function (A188999).at n=18A292984
• Bi-unitary highly composite numbers: where the number of bi-unitary divisors of n (A286324) increases to a record.at n=21A293185
• Start with n and find the LCM of n and A140635(n), and continue until a number m is reached such that A140635(m) = m.at n=16A306585
• Start with n and find the LCM of n and A140635(n), and continue until a number m is reached such that A140635(m) = m.at n=33A306585
• Highly composite numbers (A002182) that are not superabundant numbers (A004394).at n=16A308913
• Smallest highly composite number that has n prime factors counted with multiplicity.at n=15A328521
• Let p_i (i=1..m) denote the primes <= n, and let e_i be the maximum number such that p_i^e_i <= n; then a(n) = Product_{i=1..m} p_i^(2*e_i-1).at n=16A340516
• Let p_i (i=1..m) denote the primes <= n, and let e_i be the maximum number such that p_i^e_i <= n; then a(n) = Product_{i=1..m} p_i^(2*e_i-1).at n=17A340516