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!)
A175701 a(n) = n ^ (phi(n)+1), phi(n) = A000010(n) = Euler totient function. 1

%I #12 Sep 08 2022 08:45:51

%S 1,4,27,64,3125,216,823543,32768,4782969,100000,285311670611,248832,

%T 302875106592253,105413504,38443359375,68719476736,

%U 827240261886336764177,612220032,1978419655660313589123979

%N a(n) = n ^ (phi(n)+1), phi(n) = A000010(n) = Euler totient function.

%H Vincenzo Librandi, <a href="/A175701/b175701.txt">Table of n, a(n) for n = 1..300</a>

%F a(n) = n*A062981(n). - _R. J. Mathar_, Apr 01 2014

%e For n = 6, a(6) = 6 ^ (phi(6)+1) = 6 ^ (A000010(6)+1) = 6 ^ (2+1) = 216.

%p A175701 := proc(n)

%p n^(numtheory[phi](n)+1) ;

%p end proc: # _R. J. Mathar_, Apr 01 2014

%t Table[n^(EulerPhi[n]+1),{n,1,30}] (* _Vincenzo Librandi_, Jul 13 2012 *)

%o (Magma) [n^(EulerPhi(n)+1): n in [1..25]]; // _Vincenzo Librandi_, Jul 13 2012

%o (PARI) a(n)=n^(eulerphi(n)+1) \\ _Charles R Greathouse IV_, Mar 05 2013

%K nonn

%O 1,2

%A _Jaroslav Krizek_, Aug 09 2010

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 April 24 19:06 EDT 2024. Contains 371962 sequences. (Running on oeis4.)