a(n) = the smallest number m such that gcd(m, tau(m)) = n where tau(k) = the number of the divisors of k (A000005).

A324553

a(n) = the smallest number m such that gcd(m, tau(m)) = n where tau(k) = the number of the divisors of k (A000005).

Terms

    a(0) =1a(1) =2a(2) =9a(3) =8a(4) =400a(5) =12a(6) =3136a(7) =24a(8) =36a(9) =80a(10) =123904a(11) =60a(12) =692224a(13) =448a(14) =2025a(15) =384a(16) =18939904a(17) =180a(18) =94633984a(19) =240a(20) =35721a(21) =11264a(22) =2218786816a(23) =360a(24) =10000a(25) =53248a(26) =26244a(27) =1344a(28) =225754218496a(29) =720

External references