OFFSET
2,1
COMMENTS
The denominator is that of the reduced fraction. The abundancy of k is sigma(k)/k, where sigma is the sum of divisors function, A000203.
FORMULA
For e > 0, a(prime(k)^e) = Sum_{j=0..e} prime(k)^j = A319076(e,k), where prime(k) = A000040(k) is the k-th prime.
For i, j > 1, a(lcm(i, j)) = max(a(i), a(j)).
a(n) = j/gcd(i, j), where i = sigma(A395192(n))*n, j = A395192(n)*sigma(n) and A395192(n) is the least proper divisor of n with the greatest abundancy.
a(n) = A396316(n) + 1.
For squarefree n, a(n) = A006530(n) + 1.
EXAMPLE
For any number n, we need consider only its maximal proper divisors (row n of A355079), since the abundancy of any number is never greater than that of any of its multiples.
For n = 20, we consider 10 and 4. The abundancy of 10 is sigma(10)/10 = 18/10 = 1.8. The abundancy of 4 is sigma(4)/4 = 7/4 = 1.75. The larger of these is 1.8. As a fraction of the abundancy of 20, which is 42/20 = 2.1, this is 1.8/2.1 = 6/7, whose denominator is 7. So a(20) = 7.
CROSSREFS
Range of terms: A108348\{1}.
KEYWORD
nonn,frac,new
AUTHOR
Peter Munn, Jun 12 2026
STATUS
approved
