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 A181311 #9 Jan 14 2022 06:21:56
%S A181311 8,16,24,36,48,72,96,108,144,180,216,240,288,300,360,480,540,600,720,
%T A181311 960,1080,1200,1260,1440,1620,1680,1800,1920,2100,2160,2400,2520,2880,
%U A181311 3024,3240,3360,3600,3780,4200,4320,5040,5760,5880,6300,6720,7200,7560
%N A181311 Highly abundant numbers k whose largest prime factor is less than log(k).
%C A181311 Every highly abundant number (A002093) is either in this sequence or A181312. Although it appears that for every n there is at least one prime p such that n*p is another highly abundant number, this conjecture fails for 46846800, the 227th term.
%H A181311 Amiram Eldar, <a href="/A181311/b181311.txt">Table of n, a(n) for n = 1..4292</a>
%t A181311 seq = {}; sm = 0; Do[s = DivisorSigma[1, n]; If[s > sm, sm = s; If[FactorInteger[n][[-1, 1]] < Log[n], AppendTo[seq, n]]], {n, 1, 8000}]; seq (* _Amiram Eldar_, Jan 14 2022 *)
%Y A181311 Cf. A002093, A181312.
%K A181311 nonn
%O A181311 1,1
%A A181311 _T. D. Noe_, Oct 13 2010