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 A308944 #7 Jul 02 2019 09:10:12
%S A308944 1,1,3,4,125,9,16807,1024,59049,15625,2357947691,5184,1792160394037,
%T A308944 282475249,474609375,17179869184,2862423051509815793,3486784401,
%U A308944 5480386857784802185939,250000000000,10382917022245341,5559917313492231481,39471584120695485887249589623
%N A308944 a(n) = Product_{k=1..n} lcm(n,k) / (k * gcd(n,k)).
%F A308944 a(n) = Product_{d|n} d^(phi(d)-phi(n/d)).
%F A308944 a(n) = n^n / Product_{d|n} d^(2*phi(n/d)).
%F A308944 a(n) = n^(-n) * Product_{d|n} d^(2*phi(d)).
%F A308944 a(n) = n^n / Product_{k=1..n} gcd(n,k)^2.
%F A308944 a(n) = n^(-n) * Product_{k=1..n} lcm(n,k)^2/k^2.
%F A308944 a(n) = A127553(n)/n!.
%F A308944 a(n) = A056916(n)/A067911(n).
%F A308944 a(p) = p^(p-2), where p is a prime.
%t A308944 Table[Product[LCM[n, k]/(k GCD[n, k]), {k, 1, n}], {n, 1, 23}]
%t A308944 Table[Product[d^(EulerPhi[d] - EulerPhi[n/d]), {d, Divisors[n]}], {n, 1, 23}]
%o A308944 (PARI) a(n) = prod(k=1, n, lcm(n, k)/(k*gcd(n, k))); \\ _Michel Marcus_, Jul 02 2019
%Y A308944 Cf. A000010, A051190, A056916, A067911, A071248, A119619, A127553.
%K A308944 nonn
%O A308944 1,3
%A A308944 _Ilya Gutkovskiy_, Jul 01 2019