cp's OEIS Frontend

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.

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

This page as a plain text file.
%I A175701 #12 Sep 08 2022 08:45:51
%S A175701 1,4,27,64,3125,216,823543,32768,4782969,100000,285311670611,248832,
%T A175701 302875106592253,105413504,38443359375,68719476736,
%U A175701 827240261886336764177,612220032,1978419655660313589123979
%N A175701 a(n) = n ^ (phi(n)+1), phi(n) = A000010(n) = Euler totient function.
%H A175701 Vincenzo Librandi, <a href="/A175701/b175701.txt">Table of n, a(n) for n = 1..300</a>
%F A175701 a(n) = n*A062981(n). - _R. J. Mathar_, Apr 01 2014
%e A175701 For n = 6, a(6) = 6 ^ (phi(6)+1) = 6 ^ (A000010(6)+1) = 6 ^ (2+1) = 216.
%p A175701 A175701 := proc(n)
%p A175701     n^(numtheory[phi](n)+1) ;
%p A175701 end proc: # _R. J. Mathar_, Apr 01 2014
%t A175701 Table[n^(EulerPhi[n]+1),{n,1,30}] (* _Vincenzo Librandi_, Jul 13 2012 *)
%o A175701 (Magma) [n^(EulerPhi(n)+1): n in [1..25]]; // _Vincenzo Librandi_, Jul 13 2012
%o A175701 (PARI) a(n)=n^(eulerphi(n)+1) \\ _Charles R Greathouse IV_, Mar 05 2013
%K A175701 nonn
%O A175701 1,2
%A A175701 _Jaroslav Krizek_, Aug 09 2010