OFFSET
1,2
LINKS
Donovan Johnson, Table of n, a(n) for n = 1..1288 (terms < 10^12)
Richard K. Guy, Divisors and desires, Amer. Math. Monthly, 104 (1997), 359-360.
MATHEMATICA
seq = {}; sm = 0; s = 0; Do[s = EulerPhi[n] + DivisorSigma[1, n];
If[s > sm, sm = s; AppendTo[seq, n]], {n, 1, 1500}]; seq (* Amiram Eldar, Dec 05 2018 *)
DeleteDuplicates[Table[{n, EulerPhi[n]+DivisorSigma[1, n]}, {n, 1500}], GreaterEqual[ #1[[2]], #2[[2]]]&][[;; , 1]] (* Harvey P. Dale, Mar 13 2023 *)
PROG
(PARI) f(n)=eulerphi(n=factor(n))+sigma(n)
r=0; for(n=1, 1e6, t=f(n); if(t>r, r=t; print1(n", "))) \\ Charles R Greathouse IV, Nov 27 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved