OFFSET
1,1
LINKS
Harry J. Smith, Table of n, a(n) for n = 1..44
EXAMPLE
37 belongs to the sequence because number of primes <= 37 is equal to 12 (counting 2,3,5,7,11,13,17,19,23,29,31,37), while phi(37)=36 (counting 1,2,...,36) and phi(36)=12 (counting 1,5,7,11,13,17,19,23,25,29,31,35).
MAPLE
with(numtheory): p:=proc(n) if pi(n)=phi(phi(n)) then n else fi end: seq(p(n), n=1..900000); # Emeric Deutsch, Feb 24 2005
PROG
(PARI) pi(n) = s=0; for(x=1, n, if(isprime(x), s++)); s; for(n=1, 10^6, if(pi(n)==eulerphi(eulerphi(n)), print(n)))
(PARI) { default(primelimit, 2500000); n=0; for (m=1, 10^9, if (primepi(m)==eulerphi(eulerphi(m)), write("b063999.txt", n++, " ", m); if (n==44, break)) ) } \\ Harry J. Smith, Sep 05 2009
CROSSREFS
KEYWORD
nonn
AUTHOR
Jason Earls, Sep 06 2001
EXTENSIONS
More terms from Emeric Deutsch, Feb 24 2005
STATUS
approved