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 A294025 #22 Nov 26 2017 05:41:17
%S A294025 945,5355,5775,6435,8415,34125,1828827,3321765909
%N A294025 Odd abundant numbers with a record small gap to the next odd abundant number.
%C A294025 The corresponding gaps are 630, 420, 210, 180, 90, 30, 18, 6.
%C A294025 The upper ends are 1575, 5775, 5985, 6615, 8505, 34155, 1828845, 3321765915, ...
%C A294025 _Emmanuel Vantieghem_ has determined that for k = 76728582876430878992529528245373 the numbers k and k+2 are abundant, so the last term of this sequence is <= k. - _Giovanni Resta_, Nov 09 2017
%H A294025 Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_880.htm">Puzzle 880. Consecutive odd abundant integers</a>
%e A294025 Odd abundant numbers are 945, 1575, 2205, 2835, 3465, 4095, 4725, 5355, 5775, 5985, 6435, 6615, ...
%e A294025 Their differences are 630, 630, 630, 630, 630, 630, 630, 420, 210, 450, 180, ...
%e A294025 The records of small differences are 630, 420, 210, 180, ...
%e A294025 And the corresponding terms are 945, 5355, 5775, 6435, ...
%t A294025 oaQ[n_] := OddQ[n] && DivisorSigma[1,n] > 2 n; s = Select[Range[100000], oaQ]; a={}; dmin = 1000; Do[d=s[[j+1]]-s[[j]]; If[d<dmin,AppendTo[a,s[[j]]];dmin=d],{j,1,Length[s]-1}]; a
%o A294025 (PARI) lista(nn) = {lastoa = 0; mg = oo; forstep (n=1, nn, 2, if (sigma(n) > 2*n, if (! lastoa, lastoa = n, if ((nmg = n - lastoa) < mg, mg = nmg; print1(lastoa, ", "))); lastoa = n;););} \\ _Michel Marcus_, Nov 09 2017
%Y A294025 Cf. A005231.
%K A294025 nonn,fini,more
%O A294025 1,1
%A A294025 _Amiram Eldar_, Oct 22 2017
%E A294025 a(8) from _Giovanni Resta_, Nov 09 2017