Smallest number m such that GCD of d(m^2) and d(m) is 2n+1 where d(m) is the number of divisors of m.
A061701
Smallest number m such that GCD of d(m^2) and d(m) is 2n+1 where d(m) is the number of divisors of m.
Terms
- a(0) =1a(1) =12a(2) =4608a(3) =1728a(4) =1260a(5) =509607936a(6) =2985984a(7) =144a(9) =5159780352a(10) =302400a(12) =207360000a(13) =887040a(16) =248832a(17) =2286144000a(19) =522547200
External references
- oeis: A061701