|
Search: id:A063935
|
|
|
| A063935 |
|
q(n) = sigma(n)-n, where q(n) = n+e(n)+e(n-e(n)) and e(n) = |eulerphi(n)-n|. |
|
+0
1
|
|
| 300, 72504, 157344, 1470456, 3454944, 7438656, 8583168, 10097920, 32175072
(list; graph; listen)
|
|
|
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
|
|
PROGRAM
|
(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: A128391 A092715 A036517 this_sequence A015275 A051306 A004225
Adjacent sequences: A063932 A063933 A063934 this_sequence 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
|
|
|
Search completed in 0.002 seconds
|
