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.
%I A289124 #7 Jul 01 2017 23:06:17
%S A289124 1,2,3,5,6,14,22,24,54,88,114,120,264,312,520,540,864,1560,3432,4320,
%T A289124 8856,9120,10464,20664,21276,32760,36840,52320,92280,106380,170040,
%U A289124 185760,201240,417960,613080,1059480,1098720,1937880,2213640,2982240,5611320,9809280
%N A289124 Numbers n such that sigma(sigma(n))/sigma(n) > sigma(sigma(m))/sigma(m) for all m < n.
%C A289124 Erdős proved that sigma(sigma(n))/sigma(n) is unbounded, thus this sequence is infinite.
%H A289124 Charles R Greathouse IV, <a href="/A289124/b289124.txt">Table of n, a(n) for n = 1..61</a>
%H A289124 Paul Erdős, <a href="http://eudml.org/doc/267559">Some remarks on the iterates of the phi and sigma functions</a>, Colloquium Mathematicae, Vol. 17, No. 2 (1967), pp. 195-202.
%t A289124 a = {}; k=1; rmax = 0; While[Length[a]<40,s = DivisorSigma[1, k]; s2 = DivisorSigma[1, s]; r = s2/s; If[r > rmax, AppendTo[a, k]; rmax = r]; k++]; a
%o A289124 (PARI) r=0; forfactored(n=1,10^10, t=sigma(sigma(n),-1); if(t>r, r=t; print1(n[1]", "))) \\ _Charles R Greathouse IV_, Jun 25 2017
%Y A289124 Cf. A000203, A051027, A066961.
%K A289124 nonn
%O A289124 1,2
%A A289124 _Amiram Eldar_, Jun 25 2017