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 A349871 #5 Dec 03 2021 09:55:02
%S A349871 60,735,1274,28674,19940,1699947,4630544,24816974,111500620,262315467,
%T A349871 30477326444
%N A349871 a(n) is the start of the least run of exactly n consecutive nobly abundant numbers (A349758).
%C A349871 a(12) > 1.6*10^11, if it exists.
%e A349871 a(2) = 735 since 735 and 736 are the least pair of consecutive numbers that are nobly abundant numbers.
%t A349871 abQ[n_] := DivisorSigma[1, n] > 2*n; nobAbQ[n_] := And @@ abQ /@ DivisorSigma[{0, 1}, n]; seq[len_, nmax_] := Module[{s = Table[0, {len}], count = 0, n = 1, n1, d}, While[n < nmax && count < len, n1 = n; If[nobAbQ[n], While[nobAbQ[++n1]]; d = n1 - n; If[d <= len && s[[d]] == 0, count++; s[[d]] = n]]; n = n1 + 1]; TakeWhile[s, # > 0 &]]; seq[6, 10^6]
%Y A349871 Cf. A349758, A349870.
%K A349871 nonn,more
%O A349871 1,1
%A A349871 _Amiram Eldar_, Dec 03 2021