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.

A140522 Numbers for which sigma(n) - 2n exceeds sigma(k) - 2k for all k < n.

This page as a plain text file.
%I A140522 #10 Mar 16 2023 15:58:31
%S A140522 1,6,12,24,36,48,60,72,84,96,108,120,168,180,240,300,336,360,420,480,
%T A140522 540,600,660,720,840,1008,1080,1200,1260,1440,1680,2100,2160,2520,
%U A140522 3240,3360,3780,3960,4200,4620,4680,5040,6300,6720,7200,7560,8400,9240,10080
%N A140522 Numbers for which sigma(n) - 2n exceeds sigma(k) - 2k for all k < n.
%H A140522 Donovan Johnson, <a href="/A140522/b140522.txt">Table of n, a(n) for n = 1..500</a>
%e A140522 72 is the smallest number > 60 with an abundance > the abundance of 60. - _Donovan Johnson_, Jan 20 2012
%t A140522 a = {1}; m = -1; For[n = 2, n < 20000, n++, If[DivisorSigma[1, n] - 2*n > m, m = DivisorSigma[1, n] - 2*n; AppendTo[a, n]]]; a (* _Stefan Steinerberger_, Aug 04 2008 *)
%t A140522 DeleteDuplicates[Table[{n,DivisorSigma[1,n]-2n},{n,11000}],GreaterEqual[ #1[[2]],#2[[2]]]&][[;;,1]] (* _Harvey P. Dale_, Mar 16 2023 *)
%Y A140522 Cf. A002093 (d=0) and A034090 (d=1).
%K A140522 nonn
%O A140522 1,2
%A A140522 _J. Lowell_, Jul 02 2008
%E A140522 More terms from _Stefan Steinerberger_, Aug 04 2008