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 A062981 #32 Feb 17 2022 00:01:23
%S A062981 1,2,9,16,625,36,117649,4096,531441,10000,25937424601,20736,
%T A062981 23298085122481,7529536,2562890625,4294967296,48661191875666868481,
%U A062981 34012224,104127350297911241532841,25600000000,7355827511386641
%N A062981 a(n) = n^phi(n).
%H A062981 T. D. Noe, <a href="/A062981/b062981.txt">Table of n, a(n) for n = 1..100</a>
%H A062981 Brett A. Harrison, <a href="http://www.jstor.org/stable/27642336">On the reducibility of cyclotomic polynomials over finite fields</a>, Am. Math. Monthly, Vol. 114, No. 9 (2007), pp. 813-818.
%F A062981 a(n) = A001783(n) / (Product_{d|n} (d!/d^d)^A008683(n/d)) = (Product_{GCD(k, n)=1} k) / (Product_{d|n} (d!/d^d)^A008683(n/d)) = A175504(n) * n. - _Jaroslav Krizek_, May 31 2010
%F A062981 Sum_{n>=1} 1/a(n) = A239725. - _Amiram Eldar_, Nov 19 2020
%p A062981 A062981 := proc(n)
%p A062981 n^numtheory[phi](n) ;
%p A062981 end proc:
%p A062981 seq(A062981(n),n=1..20) ; # _R. J. Mathar_, Oct 15 2011
%t A062981 Table[n^EulerPhi[n],{n,30}] (* _Harvey P. Dale_, Mar 30 2012 *)
%o A062981 (PARI) a(n) = n^eulerphi(n); \\ _Harry J. Smith_, Aug 14 2009
%o A062981 (Magma) [n^EulerPhi(n): n in [1..25]]; // _Vincenzo Librandi_, Apr 05 2017
%Y A062981 Cf. A000010, A004124, A193679, A239725.
%K A062981 nice,nonn
%O A062981 1,2
%A A062981 _Reinhard Zumkeller_, Jul 24 2001