|
|
A063935
|
|
q(n) = sigma(n) - n, where q(n) = n + e(n) + e(n-e(n)) and e(n) = n - eulerphi(n).
|
|
0
|
|
|
300, 72504, 157344, 1470456, 3454944, 7438656, 8583168, 10097920, 32175072, 1519507968, 1699447296, 8450553312
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MATHEMATICA
|
F[n_] := Abs[EulerPhi[n] - n]; Q[n_] := n+F[n]+F[n-F[n]]; Do[If[Q[n] == DivisorSigma[1, n] - n, Print[n]], {n, 10^9}] (* Ryan Propper, Jan 01 2007 *)
|
|
PROG
|
(PARI) e(n) = n - eulerphi(n);
q(n) = n+e(n)+e(n-e(n));
for(n=1, 10^8, if(q(n)==sigma(n)-n, print1(n, ", ")))
|
|
CROSSREFS
|
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|