a(n) is the smallest integer k such that n*k is the smallest multiple of k with twice as many divisors as k, or 0 if no such number is possible.
A139315
a(n) is the smallest integer k such that n*k is the smallest multiple of k with twice as many divisors as k, or 0 if no such number is possible.
Terms
- a(0) =1a(1) =2a(2) =6a(3) =12a(4) =60a(5) =120a(6) =1260a(7) =840a(8) =0a(9) =2520a(10) =27720a(11) =55440a(12) =0a(13) =720720a(14) =1081080a(15) =2162160a(16) =61261200a(17) =36756720a(18) =1396755360a(19) =2327925600a(20) =0a(21) =698377680a(22) =16062686640a(23) =48188059920a(24) =0a(25) =749592043200a(26) =160626866400a(27) =240940299600a(28) =0
External references
- oeis: A139315