a(n) = Product_{d|n} lcm(d, tau(d)) where tau(k) is the number of divisors of k (A000005).

Terms

a(0) =1a(1) =2a(2) =6a(3) =24a(4) =10a(5) =144a(6) =14a(7) =192a(8) =54a(9) =400a(10) =22a(11) =20736a(12) =26a(13) =784a(14) =3600a(15) =15360a(16) =34a(17) =23328a(18) =38a(19) =288000a(20) =7056a(21) =1936a(22) =46a(23) =3981312a(24) =750a(25) =2704a(26) =5832a(27) =790272a(28) =58a(29) =207360000