login
A349608
a(n) is the number of divisors of the n-th highly abundant number (A002093).
2
1, 2, 2, 3, 4, 4, 4, 6, 5, 6, 6, 8, 8, 9, 8, 10, 12, 12, 12, 12, 12, 12, 16, 15, 16, 18, 16, 16, 20, 18, 18, 20, 24, 24, 24, 24, 24, 24, 24, 24, 30, 32, 28, 30, 32, 30, 36, 36, 32, 30, 40, 36, 32, 36, 36, 40, 36, 36, 48, 42, 40, 40, 40, 48, 45, 48, 48, 48, 48
OFFSET
1,2
LINKS
FORMULA
a(n) = A000005(A002093(n)).
EXAMPLE
a(1) = A000005(A002093(1)) = A000005(1) = 1.
a(10) = A000005(A002093(10)) = A000005(18) = 6.
MATHEMATICA
seq = {}; sm = 0; Do[s = DivisorSigma[1, n]; If[s > sm, sm = s; AppendTo[seq, DivisorSigma[0, n]]], {n, 1, 10^4}]; seq
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Nov 23 2021
STATUS
approved