A328855 Number of factorizations of n into numbers with an odd number of distinct prime factors.
1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 5, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 2, 1, 7, 1, 1, 1, 4, 1, 1, 1, 3, 1, 2, 1, 2, 2, 1, 1, 5, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 4, 1, 1, 2, 11, 1, 2, 1, 2, 1, 2, 1, 6, 1, 1, 2, 2, 1, 2, 1, 5, 5, 1, 1, 4, 1, 1, 1, 3, 1, 4
Offset: 1
Keywords
Examples
a(8) = 3 because 8 = 2 * 4 = 2 * 2 * 2.
Formula
Dirichlet g.f.: Product_{k>=1} 1 / (1 - A030230(k)^(-s)).