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 A231088 #25 Apr 06 2024 07:53:40
%S A231088 100,196,220,304,348,350,364,460,616,640,700,736,832,1036,1060,1144,
%T A231088 1180,1216,1312,1372,1456,1480,1660,1696,1876,1900,1936,1984,1998,
%U A231088 2000,2020,2176,2208,2210,2296,2320,2548,2620,2716,2740,2748,2750,2988,2990,2992
%N A231088 Initial members of abundant triples, i.e., values of k such that (k, k+2, k+4) are all abundant numbers.
%H A231088 Amiram Eldar, <a href="/A231088/b231088.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..5000 from Shyam Sunder Gupta)
%e A231088 100, 102, 104 are abundant, thus the smallest number is listed.
%t A231088 AbundantQ[n_] := DivisorSigma[1, n] > 2n; m = 0; a = {}; Do[If[AbundantQ[n], m = m + 1; If[m > 2, AppendTo[a, n - 4]], m = 0], {n, 2, 1000000, 2}];a
%t A231088 2*Flatten[Position[Partition[Table[If[DivisorSigma[1,n]>2n,1,0],{n,2,3000,2}],3,1], {1,1,1}]] (* _Harvey P. Dale_, Aug 19 2014 *)
%t A231088 2*SequencePosition[Table[If[DivisorSigma[1,n]>2n,1,0],{n,2,3000,2}],{1,1,1}][[;;,1]] (* _Harvey P. Dale_, Feb 27 2023 *)
%o A231088 (PARI) is(n)=sigma(n,-1)>2 && sigma(n+2,-1)>2 && sigma(n+4,-1)>2 \\ _Charles R Greathouse IV_, Feb 21 2017
%Y A231088 Cf. A005101, A096399, A108926, A231086, A231089, A231090, A231092, A231093.
%K A231088 nonn
%O A231088 1,1
%A A231088 _Shyam Sunder Gupta_, Nov 03 2013