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 A228962 #8 Nov 11 2013 17:23:32
%S A228962 114,228,234,582,654,1002,1008,1242,1248,1254,1542,1794,1908,2094,
%T A228962 2214,2262,2328,2334,2502,2634,2754,2988,3054,3102,3348,3354,3642,
%U A228962 4182,4188,4314,4362,4368,4428,4434,4482,4728,4788,4902,5202,5208,5268,5274,5742,5862
%N A228962 Smallest sets of 5 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.
%H A228962 Shyam Sunder Gupta, <a href="/A228962/b228962.txt">Table of n, a(n) for n = 1..5000</a>
%e A228962 114, 120, 126, 132, 138 is the smallest set of 5 consecutive abundant numbers in arithmetic progression so 114 is in the list.
%t A228962 AbundantQ[n_] := DivisorSigma[1, n] > 2 n; m = 2; z1 = 18; cd = 6; a = {}; Do[If[AbundantQ[n], If[n - z1 == cd, m = m + 1; If[m > 4, AppendTo[a, n - 4*cd]], m = 2; cd = n - z1]; z1 = n], {n, 19, 1000000}]; a
%Y A228962 Cf. A005101, A228433, A228844, A228961.
%K A228962 nonn
%O A228962 1,1
%A A228962 _Shyam Sunder Gupta_, Nov 10 2013