The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062981 a(n) = n^phi(n). 7
1, 2, 9, 16, 625, 36, 117649, 4096, 531441, 10000, 25937424601, 20736, 23298085122481, 7529536, 2562890625, 4294967296, 48661191875666868481, 34012224, 104127350297911241532841, 25600000000, 7355827511386641 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Brett A. Harrison, On the reducibility of cyclotomic polynomials over finite fields, Am. Math. Monthly, Vol. 114, No. 9 (2007), pp. 813-818.
FORMULA
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
Sum_{n>=1} 1/a(n) = A239725. - Amiram Eldar, Nov 19 2020
MAPLE
A062981 := proc(n)
n^numtheory[phi](n) ;
end proc:
seq(A062981(n), n=1..20) ; # R. J. Mathar, Oct 15 2011
MATHEMATICA
Table[n^EulerPhi[n], {n, 30}] (* Harvey P. Dale, Mar 30 2012 *)
PROG
(PARI) a(n) = n^eulerphi(n); \\ Harry J. Smith, Aug 14 2009
(Magma) [n^EulerPhi(n): n in [1..25]]; // Vincenzo Librandi, Apr 05 2017
CROSSREFS
Sequence in context: A078707 A085332 A204424 * A069622 A334193 A200944
KEYWORD
nice,nonn
AUTHOR
Reinhard Zumkeller, Jul 24 2001
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 6 17:29 EDT 2024. Contains 373134 sequences. (Running on oeis4.)