A091193 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A091193

Smallest number having n abundant divisors.

1, 12, 24, 36, 60, 72, 168, 120, 180, 288, 240, 432, 504, 360, 864, 1296, 960, 840, 720, 1080, 3456, 1800, 2016, 1440, 1680, 3024, 2160, 3780, 2880, 2520, 5280, 3360, 6048, 4320, 6480, 22440, 11340, 7200, 6720, 7920, 5040, 10800, 7560, 12960, 18900, 13440

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

A080224(a(n))=n and A080224(m)<>n for m<a(n).

LINKS

Amiram Eldar, Table of n, a(n) for n = 0..1000

Eric Weisstein's World of Mathematics, Abundant Number.

MATHEMATICA

numd[n_] := Length@Select[Divisors[n], DivisorSigma[1, #] > 2 # &]; m = 100; s =

Table[0, {m}]; n = 1; c = 0; While[c < m, k = numd[n]; If[k > 0 && k <= m && s[[k]] == 0, s[[k]] = n; c++]; n++]; s (* Amiram Eldar, Jun 24 2019 *)

CROSSREFS