A349608 a(n) is the number of divisors of the n-th highly abundant number (A002093).

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

Amiram Eldar, Table of n, a(n) for n = 1..10000

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

Cf. A000005, A002093, A034885, A349607.

Sequence in context: A366274 A284511 A262976 * A224709 A309965 A366385

Adjacent sequences: A349605 A349606 A349607 * A349609 A349610 A349611

Keyword

nonn

Author

Amiram Eldar, Nov 23 2021

Status

approved