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 A307101 #13 Sep 08 2022 08:46:21
%S A307101 1,4,6,96,10,3456,14,24576,486,16000,22,859963392,26,43904,54000,
%T A307101 125829120,34,9795520512,38,18432000000,148176,170368,46,
%U A307101 584325558976905216,3750,281216,1417176,138784407552,58,80621568000000000,62,24739011624960,574992,628864
%N A307101 a(n) = Product_{d|n} (tau(d)*pod(d)) where tau(k) = the number of divisors of k (A000005) and pod(k) = the product of the divisors of k (A007955).
%C A307101 n divides a(n) for all n.
%F A307101 a(n) = Product_{d|n} tau(d) * Product_{d|n} pod(d) = A211776(n) * A266265(n).
%F A307101 a(p) = 2p for p = primes (A000040).
%e A307101 a(6) = (tau(1)*pod(1)) * (tau(2)*pod(2)) * (tau(3)*pod(3)) * (tau(6)*pod(6)) = (1*1) * (2*2) * (2*3) * (4*36) = 3456.
%o A307101 (Magma) [&*[# [c: c in Divisors(d)] * &*[c: c in Divisors(d)]: d in Divisors(n)]: n in [1..100]]
%o A307101 (PARI) a(n) = my(d=divisors(n)); prod(k=1, #d, my(dd=divisors(d[k])); #dd*vecprod(dd)); \\ _Michel Marcus_, Apr 25 2019
%Y A307101 Cf. A000005, A007955, A307100.
%K A307101 nonn
%O A307101 1,2
%A A307101 _Jaroslav Krizek_, Apr 25 2019