I'm looking for a closed-form formula for the number of partitions of integer $n$ into integer parts less than or equal to 9. Thanks.
closed as off-topic by Travis, colormegone, zz20s, Leucippus, Daniel W. Farlow Apr 22 '16 at 14:57
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Travis, colormegone, zz20s
One can show that the number $p_k(n)$ of partitions of $n$ into exactly $k$ parts is equal to the number of partitions of $n$ in which the largest part has size $k$. So you are looking for a formula for $p_9(k)$. Rubinstein has given an explicit formula for $p_k(n)$ in terms of Bernoulli polynomials, see here. A. Sills has given Rademacher-type formulas for the restricted partition function.