login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A328855
Number of factorizations of n into numbers with an odd number of distinct prime factors.
1
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,4
FORMULA
Dirichlet g.f.: Product_{k>=1} 1 / (1 - A030230(k)^(-s)).
EXAMPLE
a(8) = 3 because 8 = 2 * 4 = 2 * 2 * 2.
CROSSREFS
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Oct 28 2019
STATUS
approved