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 A231092 #14 Mar 24 2025 14:05:59
%S A231092 221355126,221355128,402640540,402640542,668862580,668862582,
%T A231092 739577140,739577142,1415514246,1415514248,1598558646,1598558648,
%U A231092 1678915540,1678915542,1714512246,1714512248,1812156340,1812156342,1829740086,1829740088,1892686326,1892686328
%N A231092 Initial members of abundant septuplets, i.e., values of n such that (n, n+2, n+4, n+6, n+8, n+10, n+12) are all abundant numbers.
%C A231092 If the terms are divided into groups of two, are the differences between the two grouped terms always 2? - _Harvey P. Dale_, Mar 24 2025
%H A231092 Donovan Johnson, <a href="/A231092/b231092.txt">Table of n, a(n) for n = 1..1000</a>
%e A231092 221355126, 221355128, 221355130, 221355132, 221355134, 221355136, 221355138 are abundant, thus the smallest number is listed.
%t A231092 AbundantQ[n_] := DivisorSigma[1, n] > 2n; m = 0; a = {}; Do[If[AbundantQ[n], m = m + 1; If[m > 6, AppendTo[a, n - 12]], m = 0], {n, 2, 2000000000, 2}];a
%t A231092 SequencePosition[Table[If[DivisorSigma[1,n]>2n,1,0],{n,18927*10^5}],{1,_,1,_,1,_,1,_,1,_,1,_,1}][[;;,1]] (* _Harvey P. Dale_, Mar 24 2025 *)
%o A231092 (PARI) is(n)=sigma(n,-1)>2 && sigma(n+2,-1)>2 && sigma(n+4,-1)>2 && sigma(n+6,-1)>2 && sigma(n+8,-1)>2 && sigma(n+10,-1)>2 && sigma(n+12,-1)>2 \\ _Charles R Greathouse IV_, Feb 21 2017
%Y A231092 Cf. A005101, A108926, A231086, A231088, A231089, A231090, A231093.
%K A231092 nonn
%O A231092 1,1
%A A231092 _Shyam Sunder Gupta_, Nov 03 2013