cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

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
Offset: 1

Views

Author

David A. Corneth, Mar 29 2021

Keywords

Comments

This sequence is the primitive version of A169594.

Examples

			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

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

Formula

a(n) = A169594(A025487(n)).
Showing 1-1 of 1 results.