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 A066841 #17 Sep 24 2017 10:45:34
%S A066841 1,2,3,16,5,432,7,2048,243,8000,11,143327232,13,87808,455625,67108864,
%T A066841 17,117546246144,19,1310720000000,15752961,5451776,23,
%U A066841 252428641478023053312,78125,35995648,387420489,3537090251849728,29
%N A066841 a(n) = Product{k|n} k^(n/k); product is over the positive divisors of n.
%H A066841 Harry J. Smith, <a href="/A066841/b066841.txt">Table of n, a(n) for n = 1..200</a>
%e A066841 a(6) = 432 = 1^6 * 2^3 * 3^2 * 6^1 because 1, 2, 3 and 6 are the divisors of 6.
%t A066841 Table[Times @@ Map[#^(n/#) &, Divisors@ n], {n, 29}] (* _Michael De Vlieger_, Sep 24 2017 *)
%o A066841 (PARI) { for (n=1, 200, d=divisors(n); p=1; for (i=2, length(d), k=d[i]; p*=k^(n/k)); write("b066841.txt", n, " ", p) ) } \\ _Harry J. Smith_, Apr 01 2010
%Y A066841 Cf. A140554.
%K A066841 nonn
%O A066841 1,2
%A A066841 _Leroy Quet_, Jan 20 2002