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!)
A070800 Smallest prime greater than phi(n): a(n) = nextprime(phi(n)). 6

%I #23 Dec 05 2017 04:08:13

%S 2,3,3,5,3,7,5,7,5,11,5,13,7,11,11,17,7,19,11,13,11,23,11,23,13,19,13,

%T 29,11,31,17,23,17,29,13,37,19,29,17,41,13,43,23,29,23,47,17,43,23,37,

%U 29,53,19,41,29,37,29,59,17,61,31,37,37,53,23,67,37,47,29,71,29,73,37

%N Smallest prime greater than phi(n): a(n) = nextprime(phi(n)).

%H Antti Karttunen, <a href="/A070800/b070800.txt">Table of n, a(n) for n = 2..16384</a>

%F a(n) = prime(1 + primepi(phi(n))) = A151800(A000010(n)).

%t Table[Prime[1+PrimePi[EulerPhi[w]]], {w, 2, 128}] (* or *)

%t NextPrime[EulerPhi[#]] & /@ Range[2,80] (* _Harvey P. Dale_, Jan 30 2011 *)

%o (PARI) a(n)=nextprime(eulerphi(n)+1) \\ _Charles R Greathouse IV_, Oct 31 2011

%Y Cf. A000010, A070801, A151800, A078773.

%K easy,nonn

%O 2,1

%A _Labos Elemer_, May 08 2002

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 August 26 16:29 EDT 2024. Contains 375459 sequences. (Running on oeis4.)