login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #8 Oct 28 2019 20:06:25

%S 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,

%T 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,

%U 1,2,1,6,1,1,2,2,1,2,1,5,5,1,1,4,1,1,1,3,1,4

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

%F Dirichlet g.f.: Product_{k>=1} 1 / (1 - A030230(k)^(-s)).

%e a(8) = 3 because 8 = 2 * 4 = 2 * 2 * 2.

%Y Cf. A001055, A030230, A050330, A328856.

%K nonn

%O 1,4

%A _Ilya Gutkovskiy_, Oct 28 2019