A050317 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

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

OFFSET

2,14

LINKS

Table of n, a(n) for n=2..103.

FORMULA

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

CROSSREFS

Cf. A000041, A001055, A046064.

Sequence in context: A330167 A307776 A341027 * A325223 A141095 A175599

Adjacent sequences: A050314 A050315 A050316 * A050318 A050319 A050320

KEYWORD

nonn

AUTHOR

Christian G. Bower, Sep 15 1999

STATUS

approved