cp's OEIS Frontend

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.

A141037 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

This page as a plain text file.
%I A141037 #13 Aug 31 2019 04:34:37
%S A141037 1,4,9,12,16,24,30,36,60,72,90,120,144,180,240,336,360,420,480,504,
%T A141037 600,630,672,720,840,1080,1260,1440,1680,2160,2520,3360,3600,3780,
%U A141037 3960,4200,4320,4620,5040,6720,7560,9240,10080,12600,13860,15120,18480,20160
%N A141037 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.
%H A141037 Amiram Eldar, <a href="/A141037/b141037.txt">Table of n, a(n) for n = 1..250</a>
%e A141037 12 qualifies because it sets a record of 1+2+3=6. (1, 2 and 3 are the divisors of 12 <= sqrt(12).)
%t A141037 lst = {}; s = -1; Do[t = Plus @@ Select[Divisors@n, # <= Sqrt@n &]; If[t > s, AppendTo[lst, n]; s = t], {n, 25199}]; lst (* _Robert G. Wilson v_, Aug 03 2008 *)
%Y A141037 Cf. A002093 (all divisors), A034090 (all divisors except n itself).
%Y A141037 Cf. A066839, A143837 (records of sums).
%K A141037 nonn
%O A141037 1,2
%A A141037 _J. Lowell_, Jul 28 2008
%E A141037 More terms from _Robert G. Wilson v_, Aug 03 2008