

A023196


Nondeficient numbers: numbers n such that sigma(n) >= 2n; union of A000396 and A005101.


37



6, 12, 18, 20, 24, 28, 30, 36, 40, 42, 48, 54, 56, 60, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120, 126, 132, 138, 140, 144, 150, 156, 160, 162, 168, 174, 176, 180, 186, 192, 196, 198, 200, 204, 208, 210, 216, 220, 222, 224, 228, 234, 240, 246, 252
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Also called the nondeficient numbers.
If n is a member so is every positive multiple of n. The "primitive" members form A006039.
The sequence of n that give local minima for A004125, i.e., such that A004125(n1) > A004125(n) and A004125(n) < A004125(n+1) coincides with this sequence for the first 1014 terms. Then there appears 4095 which is a term of A023196 but is not a local minimum.  Max Alekseyev, Jan 26 2005
Also, union of pseudoperfect and weird numbers. Cf. A005835, A006037.  Franklin T. AdamsWatters, Mar 29 2006
n is in the sequence if and only if A004125(n1) > A004125(n).  Jaycob Coleman, Mar 31 2014


LINKS

T. D. Noe, Table of n, a(n) for n = 1..1000
Paul Pollack and Carl Pomerance, Some problems of Erdos on the sumofdivisors function, For Richard Guy on his 99th birthday: May his sequence be unbounded, 2015, to appear.


MAPLE

A023196:=n>`if`(numtheory[sigma](n)>=2*n, n, NULL): seq(A023196(n), n=1..380); # Wesley Ivan Hurt, Apr 18 2017


MATHEMATICA

Select[Range[300], DivisorSigma[1, #] >= 2# &] (* Harvey P. Dale, Sep 26 2014 *)


PROG

(PARI) is(n)=sigma(n, 1)>=2 \\ Charles R Greathouse IV, Mar 09 2014
(GAP) Filtered([1..260], n>Sigma(n)>=2*n); # Muniru A Asiru, Dec 04 2018
(MAGMA) [n: n in [1..300]  not (2*n gt DivisorSigma(1, n))]; // Vincenzo Librandi, Dec 05 2018


CROSSREFS

Cf. A000203, A004125, A006039, A000396, A005101.
Sequence in context: A097216 A326133 A177052 * A204829 A005835 A007620
Adjacent sequences: A023193 A023194 A023195 * A023197 A023198 A023199


KEYWORD

nonn,nice,changed


AUTHOR

David W. Wilson


STATUS

approved



