OFFSET
1,1
COMMENTS
If n^2+1 is prime, trivially phi(n^2+1)/n=n.
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..100
MATHEMATICA
cep[n_]:=Module[{c=n^2+1, ep}, ep=EulerPhi[c]; If[CompositeQ[c] && Mod[ ep, n] == 0, ep/n, Nothing]]; Array[cep, 47000] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jun 25 2021 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Feb 22 2002
STATUS
approved