|
%I #10 Jun 24 2019 04:01:14
%S 1,12,24,36,60,72,168,120,180,288,240,432,504,360,864,1296,960,840,
%T 720,1080,3456,1800,2016,1440,1680,3024,2160,3780,2880,2520,5280,3360,
%U 6048,4320,6480,22440,11340,7200,6720,7920,5040,10800,7560,12960,18900,13440
%N Smallest number having n abundant divisors.
%C A080224(a(n))=n and A080224(m)<>n for m<a(n).
%H Amiram Eldar, <a href="/A091193/b091193.txt">Table of n, a(n) for n = 0..1000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/AbundantNumber.html">Abundant Number</a>.
%t numd[n_] := Length@Select[Divisors[n], DivisorSigma[1, #] > 2 # &]; m = 100; s =
%t 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 *)
%Y Cf. A080224.
%K nonn
%O 0,2
%A _Reinhard Zumkeller_, Dec 27 2003
%E More terms from _Reinhard Zumkeller_, Dec 12 2009
|
