86486400

Appears in sequences

• a(1) = 1, a(k) divides a(k+r) for all k and r and the ratios a(k+r)/a(k) are all different.at n=11A079854
• a(1) = 1. For n >= 2, a(n) = sum of the two (not necessarily distinct) earlier terms, a(j) and a(k), which maximizes d(a(j)+a(k)), where d(m) is the number of positive divisors of m. a(n) = the maximum (a(j)+a(k)) if more than one such sum has the maximum number of divisors.at n=33A115386
• a(1) = 1. For n >= 2, a(n) = sum of the two (not necessarily distinct) earlier terms, a(j) and a(k), which maximizes d(a(j)+a(k)), where d(m) is the number of positive divisors of m. a(n) = the minimum (a(j)+a(k)) if more than one such sum has the maximum number of divisors.at n=33A115387
• Ratio of (2n-1)! to number of zeros in Sylvester matrix of polynomial of n degree with all nonzero coefficients.at n=5A138896
• Partial sums of A156832.at n=12A145499
• Positive integers with more highly composite divisors (A002182) than any smaller positive integer.at n=26A181806
• Table (read by rows) of all k-digit positive integers (in ascending order) with maximum number of divisors A066150(k).at n=20A240544
• Numbers disqualified from being in A019505 for not being the smallest number with their respective number of divisors.at n=8A241813
• Sum of the integers in the reduced residue system of A002110(n).at n=5A335334
• Denominators of the fractions f(n) such that (6/Pi^2)*f(n) is the asymptotic density of the numbers k with A280292(k) = sopfr(k) - sopf(k) = n.at n=13A338560
• Numbers with a record number of exponentially squarefree divisors.at n=33A365681
• Positive integers whose maximum frequency in a fixed row of A036038 (or A078760) is equal to 3, i.e., numbers m such that A376663(m) = 3.at n=22A376670