A050332 - OEIS

A050332

Number of factorizations of n into distinct numbers with an odd number of prime factors.

1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1

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

OFFSET

1,24

COMMENTS

a(n) depends only on prime signature of n (cf. A025487). So a(24) = a(375) since 24 = 2^3*3 and 375 = 3*5^3 both have prime signature (3,1).

LINKS

R. J. Mathar, Table of n, a(n) for n = 1..2519

FORMULA

Dirichlet g.f.: Product_{n is in A026424}(1+1/n^s).

a(n) = A050333(A101296(n)). - R. J. Mathar, May 26 2017

CROSSREFS

Cf. A026424, A045778, A050333. a(p^k)=A000700. a(A002110)=A003724.