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 A228844 #8 Nov 11 2013 17:22:38
%S A228844 24,42,80,100,104,114,120,126,144,162,180,196,200,220,228,234,240,246,
%T A228844 272,282,288,304,324,348,350,364,392,402,420,426,440,460,504,572,582,
%U A228844 588,594,608,616,624,640,654,660,666,684,700,708,714,728,736,740,786
%N A228844 Smallest sets of 3 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.
%H A228844 Shyam Sunder Gupta, <a href="/A228844/b228844.txt">Table of n, a(n) for n = 1..5000</a>
%e A228844 24, 30, 36 is the smallest set of 3 consecutive abundant numbers in arithmetic progression so 24 is in the list.
%t A228844 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 > 2, AppendTo[a, n - 2*cd]], m = 2; cd = n - z1]; z1 = n], {n, 19, 1000000}]; a
%Y A228844 Cf. A005101, A228433.
%K A228844 nonn
%O A228844 1,1
%A A228844 _Shyam Sunder Gupta_, Nov 10 2013