Amiram Eldar, <a href="/A329883/b329883_1.txt">Table of n, a(n) for n = 1..500</a>
Amiram Eldar, <a href="/A329883/b329883_1.txt">Table of n, a(n) for n = 1..500</a>
reviewed
approved
proposed
reviewed
editing
proposed
Amiram Eldar, <a href="/A329883/b329883_1.txt">Table of n, a(n) for n = 1..500</a>
approved
editing
proposed
approved
editing
proposed
allocated Nonunitary highly abundant numbers: numbers m such that nusigma(m) > nusigma(k) for Amiram Eldarall k < m, where s(n) is the sum of nonunitary divisors of n (A048146).
1, 4, 8, 12, 16, 24, 32, 36, 48, 64, 72, 96, 108, 120, 144, 180, 192, 216, 288, 360, 432, 504, 576, 648, 720, 864, 1008, 1080, 1296, 1440, 1728, 1800, 2016, 2160, 2520, 2880, 3024, 3240, 3456, 3528, 3600, 4320, 5040, 5400, 5760, 6048, 6480, 7056, 7200, 8640
1,2
The corresponding record values are 0, 2, 6, 8, 14, 24, 30, 41, 56, 62, 105, 120, 140, 144, 233, 246, 248, 348, 489, 630, 764, 840, ...
usigma[1] = 1; usigma[n_] := Times @@ (1 + Power @@@ FactorInteger[n]); nusigma[n_] := DivisorSigma[1, n] - usigma[n]; num = -1; s = {}; Do[nu = nusigma[n]; If[nu > num, num = nu; AppendTo[s, n]], {n, 1, 10^4}]; s
allocated
nonn
Amiram Eldar, Nov 23 2019
approved
editing
allocated for Amiram Eldar
allocated
approved