30630600

Appears in sequences

• Members of A097212, excluding highly composite numbers (A002182).at n=15A097213
• a(n) = LCM of the integers b(k), over all k where 1 <= k <= n, where b(k) = the k-th integer from among those positive integers which are coprime to (n+1-k).at n=13A132421
• Members m of A025487 such that, if k appears in m's prime signature, k-1 appears at least as often as k (for any integer k > 1).at n=32A182863
• a(n) = the smallest number k such that Sum_{d|k} 1/tau(d) >= n.at n=34A237350
• a(n) = hypergeom([-n, -n], [1], 1) * n! / (floor(n/2)!)^2.at n=9A295864
• Lowest outliers for A057660.at n=32A308471
• Positive integers where the number of triples of divisors (d1, d2, d3) such that d1 < d2 < d3 < 2*d1 and each pair of these divisors is pairwise coprime, sets a new record.at n=30A333966
• a(n) is the least positive integer divisible by exactly n primitive nondeficient numbers (A006039).at n=29A337691
• Numbers k for which sigma(k^2)/k^2 reaches a new record, where sigma = A000203.at n=33A340816
• Positions of records in A351532, divided by 3.at n=38A351694
• a(n) is the smallest number with exactly n divisors that are square pyramidal numbers.at n=15A358543
• Numbers with a record number of exponentially squarefree divisors.at n=31A365681
• Numbers that have more biquadratefree divisors than any smaller number.at n=28A377140
• Numbers k that have a record number of divisors d such that gcd(d, k/d) is an exponentially odd number (A268335).at n=28A377708