A342929 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A342929

Number of divisors of A025487(n), counting divisor multiplicity in A025487(n).

1, 2, 4, 4, 6, 7, 9, 10, 8, 11, 12, 14, 13, 15, 16, 17, 18, 17, 22, 21, 22, 16, 22, 24, 21, 26, 28, 25, 25, 29, 29, 24, 33, 37, 30, 34, 34, 34, 36, 28, 38, 37, 39, 39, 44, 34, 44, 43, 44, 41, 30, 49, 44, 32, 52, 45, 54, 39, 53, 48, 58, 48, 36, 58, 49, 49, 67, 56

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

This sequence is the primitive version of A169594.

LINKS

David A. Corneth, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = A169594(A025487(n)).

EXAMPLE

a(11) = 12 as A025487(11) = 36 and the divisors of 36 are 1, 2, 3, 4, 6, 9, 12, 18, 36 which occur with a multiplicity of 1, 2, 2, 1, 2, 1, 1, 1, 1 respectively (1^m = 1 for all m >= 0). These multiplicities sum to 1 + 1 + 2 + 2 + 1 + 2 + 1 + 1 + 1 + 1 = 12.

CROSSREFS

Cf. A025487, A169594.

a(n) = A309947(n) + 1.

Sequence in context: A352923 A014246 A026413 * A038669 A288573 A288574

Adjacent sequences: A342926 A342927 A342928 * A342930 A342931 A342932

KEYWORD

nonn

AUTHOR

David A. Corneth, Mar 29 2021

STATUS

approved