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 A165797 #9 Feb 27 2014 06:16:29
%S A165797 1,2,9,256,625,1679616,117649,8589934592,3486784401,100000000000000,
%T A165797 25937424601,552061438912436417593344,23298085122481,
%U A165797 83668255425284801560576,332525673007965087890625
%N A165797 a(n) = n^( sigma(n) - tau(n) ).
%C A165797 The power of n with exponent given by the difference between its sum of divisors and its count of divisors.
%H A165797 Jaroslav Krizek, <a href="/A165797/b165797.txt">Table of n, a(n) for n = 1..50</a>
%F A165797 a(n) = n^(A000203(n)-A000005(n)) = n^A000203(n) / n^A000005(n) = n^A065608(n).
%F A165797 a(n) = A100879(n) / A062758(n).
%F A165797 a(p) = p^(p-1) for p = prime.
%e A165797 a(4) = 4^(sigma(4)-tau(4)) = 4^(7-3) = 4^4 = 256.
%t A165797 Table[n^[ DivisorSigma[1, n] - DivisorSigma[0, n]], {n, 50}]
%K A165797 nonn
%O A165797 1,2
%A A165797 _Jaroslav Krizek_, Sep 27 2009
%E A165797 Slightly edited by _R. J. Mathar_, Sep 29 2009