|
| |
|
|
A063935
|
|
q(n) = sigma(n)-n, where q(n) = n+e(n)+e(n-e(n)) and e(n) = |eulerphi(n)-n|.
|
|
0
| | |
|
|
|
OFFSET
| 0,1
|
|
|
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 (rpropper(AT)stanford.edu), Jan 01 2007
|
|
|
PROG
| (PARI) e(n) = abs(eulerphi(n)-n); q(n) = n+e(n)+e(n-e(n)); for(n=1, 10^8, if(q(n)==sigma(n)-n, print(n)))
|
|
|
CROSSREFS
| Sequence in context: A092715 A036517 A190880 * A015275 A051306 A151609
Adjacent sequences: A063932 A063933 A063934 * A063936 A063937 A063938
|
|
|
KEYWORD
| more,nonn
|
|
|
AUTHOR
| Jason Earls (zevi_35711(AT)yahoo.com), Aug 31 2001
|
|
|
EXTENSIONS
| One more term from Ryan Propper (rpropper(AT)stanford.edu), Jan 01 2007
|
| |
|
|
