OFFSET
1,1
COMMENTS
The sequence may be finite. Typically phi(prime(n)+1) will be on the order of n*log(n), while according to Grönwall's theorem sigma(n) = O(n * log log(n)). - Robert Israel, Sep 12 2014
MAPLE
with(numtheory): A067625:=n->`if`(sigma(n)=phi(ithprime(n)+1), n, NULL): seq(A067625(n), n=1..10^5); # Wesley Ivan Hurt, Sep 12 2014
MATHEMATICA
Select[Range[610000], DivisorSigma[1, #]==EulerPhi[Prime[#]+1]&] (* Harvey P. Dale, Mar 17 2012 *)
PROG
(PARI) a067625(m) = for(n=1, m, if(sigma(n)==eulerphi(prime(n)+1), print1(n, ", ")))
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Feb 23 2002
EXTENSIONS
More terms from Klaus Brockhaus, Mar 02 2002
STATUS
approved