1960000

Appears in sequences

• Fixed points of A083164: numbers k such that A083164(k) = k.at n=24A083166
• Triangle, read by rows, where T(n,k) = A049020([n/2],k)*A049020([(n+1)/2],k).at n=60A124526
• Number of distinct ways to place bishops (up to 2n-2) on an n X n chessboard so that no bishop is attacking another and that it is not possible to add another bishop.at n=7A146304
• a(n) = the smallest number m such that gcd(m, tau(m)) = n where tau(k) = the number of the divisors of k (A000005).at n=34A324553
• a(n) = the smallest number m such that gcd(tau(m), pod(m)) = n where tau(k) = the number of the divisors of k (A000005) and pod(k) = the product of the divisors of k (A007955).at n=34A324555
• Powerful numbers (A001694) whose sum of aliquot powerful divisors (including 1) is larger than 1 and is also powerful.at n=20A349110