This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A324528 #12 Sep 08 2022 08:46:24
%S A324528 1,2,6,24,10,36,14,64,27,100,22,1728,26,196,900,5120,34,5832,38,24000,
%T A324528 1764,484,46,331776,375,676,2916,65856,58,810000,62,98304,4356,1156,
%U A324528 4900,10077696,74,1444,6084,2560000,82,3111696,86,255552,182250,2116,94
%N A324528 a(n) = lcm(tau(n), pod(n)) where tau(k) = the number of divisors of k (A000005) and pod(n) = the product of divisors of k (A007955).
%H A324528 Harvey P. Dale, <a href="/A324528/b324528.txt">Table of n, a(n) for n = 1..1000</a>
%F A324528 a(n) = pod(n) for numbers n in A120736.
%F A324528 a(n) = tau(n) * pod(n) for numbers n in A046642.
%e A324528 For n=4: a(4) = lcm(tau(4), pod(4)) = lcm(3, 8) = 24.
%t A324528 Table[LCM[DivisorSigma[0,n],Times@@Divisors[n]],{n,50}] (* _Harvey P. Dale_, Aug 14 2019 *)
%o A324528 (Magma) [LCM(NumberOfDivisors(n), &*[d: d in Divisors(n)]): n in [1.. 100]]
%o A324528 (PARI) a(n) = my(d=divisors(n)); lcm(vecprod(d), #d); \\ _Michel Marcus_, Mar 05 2019
%Y A324528 Cf. A000005, A007955, A046642, A120736.
%K A324528 nonn
%O A324528 1,2
%A A324528 _Jaroslav Krizek_, Mar 05 2019