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 A228963 #8 Nov 11 2013 17:23:43
%S A228963 228,1002,1242,1248,2328,3348,4182,4362,4428,5202,5268,6702,6708,6882,
%T A228963 7962,7968,8142,8382,8982,9822,9888,10242,11568,11922,11988,12162,
%U A228963 12168,12588,13248,13422,13842,13848,14022,14088,14508,15282,15522,15528,16362,16368
%N A228963 Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.
%H A228963 Shyam Sunder Gupta, <a href="/A228963/b228963.txt">Table of n, a(n) for n = 1..5000</a>
%e A228963 228, 234, 240, 246, 252, 258 is the smallest set of 6 consecutive abundant numbers in arithmetic progression so 228 is in the list.
%t A228963 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 > 5, AppendTo[a, n - 5*cd]], m = 2; cd = n - z1]; z1 = n], {n, 19, 1000000}]; a
%Y A228963 Cf. A005101, A228433, A228844, A228961, A228962.
%K A228963 nonn
%O A228963 1,1
%A A228963 _Shyam Sunder Gupta_, Nov 10 2013