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 A242393 #9 May 16 2014 15:47:45
%S A242393 1,3,5,7,11,13,17,19,23,29,30,42,90,132,150,156,168,240,360,420,756,
%T A242393 924,960,1260,2160,2520,4620,5040,6720,7560,14280,16380,18480,20160,
%U A242393 31680,35280,41580,45360,50400,65520,98280,110880,171360,226800,249480,257040,262080,277200,332640
%N A242393 Records in A187202 by index.
%C A242393 The first nine odd primes are present, and then only (very) abundant numbers.
%H A242393 Robert G. Wilson v, <a href="/A242393/b242393.txt">Table of n, a(n) for n = 1..106</a>
%e A242393 The final or last difference of 30 is 50 = A187202(30). The next higher value is 104 which occurs at 42, A187202(42) = 104.
%t A242393 f[n_] := (dvr = Divisors@ n; Differences[dvr, Length@ dvr - 1][[1]]); k = 1; lst = {}; mx = 0; While[k < 100000001, If[ f@ k > mx, mx = f@ k; Print[{k, mx}]; AppendTo[lst, {k, mx}]]; k++]; Transpose[ lst][[1]]
%Y A242393 Cf. A187202.
%K A242393 nonn
%O A242393 1,2
%A A242393 _Robert G. Wilson v_, May 12 2014