A316978 - OEIS

A316978

Number of factorizations of n into factors > 1 with no equivalent primes.

1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 4, 1, 1, 1, 5, 1, 4, 1, 4, 1, 1, 1, 7, 2, 1, 3, 4, 1, 1, 1, 7, 1, 1, 1, 7, 1, 1, 1, 7, 1, 1, 1, 4, 4, 1, 1, 12, 2, 4, 1, 4, 1, 7, 1, 7, 1, 1, 1, 7, 1, 1, 4, 11, 1, 1, 1, 4, 1, 1, 1, 16, 1, 1, 4, 4, 1, 1, 1, 12, 5, 1, 1, 7, 1, 1

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

OFFSET

1,4

COMMENTS

In a factorization, two primes are equivalent if each factor has in its prime factorization the same multiplicity of both primes.

LINKS

Table of n, a(n) for n=1..86.

FORMULA

a(prime^n) = A000041(n).

a(squarefree) = 1.

EXAMPLE

The a(36) = 7 factorizations are (2*2*3*3), (2*2*9), (2*3*6), (3*3*4), (2*18), (3*12), (4*9). Missing from this list are (6*6) and (36).