A050317 Number of ways n is a product of partition numbers > 1.

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

Offset: 2

Author

Christian G. Bower, Sep 15 1999

Keywords

• nonn

Crossrefs

Cf. A000041, A001055, A046064.

Formula

Dirichlet g.f.: Product_{n is a partition number > 1}(1/(1-1/n^s)).