cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A015702 Numbers k where phi(k) + sigma(k) increases to a record value.

This page as a plain text file.
%I A015702 #26 Mar 22 2025 04:43:02
%S A015702 1,2,3,4,5,6,8,10,12,16,18,20,24,30,36,40,42,48,56,60,72,84,90,96,108,
%T A015702 120,144,168,180,210,216,240,280,288,300,324,336,360,420,480,504,540,
%U A015702 576,600,648,660,672,720,840,960,1008,1080,1200,1260,1440
%N A015702 Numbers k where phi(k) + sigma(k) increases to a record value.
%H A015702 Donovan Johnson, <a href="/A015702/b015702.txt">Table of n, a(n) for n = 1..1288</a> (terms < 10^12)
%H A015702 Richard K. Guy, <a href="http://www.jstor.org/stable/2974586">Divisors and desires</a>, Amer. Math. Monthly, 104 (1997), 359-360.
%t A015702 seq = {}; sm = 0; s = 0; Do[s = EulerPhi[n] + DivisorSigma[1, n];
%t A015702 If[s > sm, sm = s; AppendTo[seq, n]], {n, 1, 1500}]; seq (* _Amiram Eldar_, Dec 05 2018 *)
%t A015702 DeleteDuplicates[Table[{n,EulerPhi[n]+DivisorSigma[1,n]},{n,1500}],GreaterEqual[ #1[[2]],#2[[2]]]&][[;;,1]] (* _Harvey P. Dale_, Mar 13 2023 *)
%o A015702 (PARI) f(n)=eulerphi(n=factor(n))+sigma(n)
%o A015702 r=0;for(n=1,1e6,t=f(n); if(t>r,r=t; print1(n", "))) \\ _Charles R Greathouse IV_, Nov 27 2013
%Y A015702 Cf. A000203, A000010, A018892, A018894, A065387.
%K A015702 nonn
%O A015702 1,2
%A A015702 _Robert G. Wilson v_