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 A181312 #9 Jan 14 2022 07:32:33
%S A181312 1,2,3,4,6,10,12,18,20,30,42,60,84,90,120,168,210,336,420,504,630,660,
%T A181312 840,1008,1560,1980,2340,3120,3960,4620,4680,6120,6240,7920,9240,
%U A181312 10920,11880,12240,13860,16380,18480,19800,21840,23760,27720,32760,36960
%N A181312 Highly abundant numbers k whose largest prime factor is greater than log(k).
%C A181312 Every highly abundant number (A002093) is either in this sequence or A181311. Although it appears that dividing any term by its largest prime factor produces another highly abundant number, this conjecture fails for 2942007868800, the 527th term.
%H A181312 Amiram Eldar, <a href="/A181312/b181312.txt">Table of n, a(n) for n = 1..5708</a>
%t A181312 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, 37000}]; seq (* _Amiram Eldar_, Jan 14 2022 *)
%Y A181312 Cf. A002093, A181311.
%K A181312 nonn
%O A181312 1,2
%A A181312 _T. D. Noe_, Oct 13 2010