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 A141406 #12 Aug 07 2020 02:14:19
%S A141406 1,2,6,12,20,24,30,40,48,60,72,90,120,168,180,240,336,360,420,480,504,
%T A141406 600,630,672,720,840,1080,1260,1440,1680,2160,2520,3360,3780,3960,
%U A141406 4200,4320,4620,5040,6720,7560,9240,10080,12600,13860,15120,18480,20160
%N A141406 Numbers n where the sum of all of its divisors < sqrt(n) exceeds the sum of all the divisors of m < sqrt(m) for all m<n.
%C A141406 Conjecture: 3600 is the largest number that belongs to exactly one of this sequence and A141037. - _J. Lowell_, Aug 05 2020
%H A141406 Amiram Eldar, <a href="/A141406/b141406.txt">Table of n, a(n) for n = 1..250</a>
%t A141406 lst = {}; s = -1; Do[t = Plus @@ Select[Divisors@n, # < Sqrt@n &]; If[t > s, AppendTo[lst, n]; s = t], {n, 100000}]; lst
%Y A141406 Cf. A141037.
%K A141406 nonn
%O A141406 1,2
%A A141406 _Robert G. Wilson v_, Aug 03 2008