OFFSET
1,2
COMMENTS
MATHEMATICA
G[n_, k_] := G[n, k] = Mod[Sum[PowerMod[i, k, n], {i, 1, n}], n];
Select[Range[2000], G[#, EulerPhi[#]] == n-2 &]
fa=FactorInteger;
se[n_, k_] := Select[Transpose[fa[n]][[1]], IntegerQ[k/(# - 1)] &];
sumlis[li_] := Sum[li[[i]], {i, 1, Length[li]}]
Table[If[Mod[-n/se[n, EulerPhi[n]] // sumlis, n] == n-2, n], {n, 1,
1000000}] // Union
PROG
(PARI) isok(n) = sumdiv(n, d, eulerphi(n/d) * Mod(d, n)^eulerphi(n)) == -2; \\ Daniel Suteu, Jan 13 2020
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
José María Grau Ribas, Nov 30 2019
EXTENSIONS
a(7)-a(8) from Giovanni Resta, Feb 27 2020
Edited and a(9)-a(12) added by Max Alekseyev, Nov 10 2025
STATUS
approved
