OFFSET
1,1
COMMENTS
The exponential abundancy of a number k is esigma(k)/k, where esigma is the sum of exponential divisors of k (A051377).
All the terms are powerful numbers (A001694) because esigma(k)/k depends only on the powerful part of k (A057521). - Amiram Eldar, May 06 2025
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..36
EXAMPLE
The first 6 exponential abundant numbers, 900, 1764, 3600, 4356, 4500 and 4900, have decreasing values of exponential abundancy: 2.4, 2.285..., 2.2, 2.181..., 2.08, 2.057... and therefore they are in this sequence. The next exponential abundant number with a lower exponential abundancy is 12348 with eisgma(12348)/12348 = 2.040...
MATHEMATICA
fun[p_, e_] := DivisorSum[e, p^# &]; esigma[1] = 1; esigma[n_] := Times @@ fun @@@ FactorInteger[n]; rm = 3; s={}; Do[r = esigma[n]/n; If[r <= 2, Continue[]]; If[r < rm, rm = r; AppendTo[s, n]], {n, 1, 10^6}]; s
CROSSREFS
The exponential version of A071927.
KEYWORD
nonn
AUTHOR
Amiram Eldar, Jul 14 2020
EXTENSIONS
a(23)-a(27) from Amiram Eldar, May 06 2025
STATUS
approved
