A340034 a(n) is the number of ways to represent A025487(n) as a product of the largest possible number of distinct factors in the product.

1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 3, 1, 3, 4, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2, 5, 2, 4, 4, 7, 3, 6, 1, 4, 1, 9, 7, 1, 1, 1, 1, 1, 1, 3, 7, 4, 2, 2, 3, 1, 6, 2, 1, 7, 3, 10, 1, 11, 5, 9, 7, 2, 17, 5, 5, 1, 9, 11, 1, 2, 10, 1, 1, 12, 1, 1, 14, 9, 3, 2, 10, 1, 4, 1

Offset

1,6

Links

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

Example

a(13) = 3 as there are three ways to represent A025487(13) = 60 as a product of largest possible number of distinct factors in the product. That number is 4 and the products are 1 * 2 * 3 * 10 = 1 * 2 * 5 * 6 = 1 * 3 * 4 * 5 = 60.

Crossrefs

Cf. A025487, A338160.

Sequence in context: A097637 A161094 A307343 * A331310 A241597 A374164

Adjacent sequences: A340031 A340032 A340033 * A340035 A340036 A340037

Keyword

nonn,look

Author

David A. Corneth, Feb 04 2021

Status

approved