I am curious, what kind of exact formulas exist for the partition function $p(n)$?


I seem to remember an exact formula along the lines $p(n) = \sum\_k f(n, k)$, where $f(n, k)$ was some extremely messy transcendental function, and the approximation was so good that for large $n$ one could simply take the $k = 1$ term and truncate this to the nearest integer to get an exact formula.


Reviewing the literature, it seems that I misremembered Rademacher's exact formula, which *is* of the above type but which requires more than one term. I am curious if there are other exact formulas, particularly of the type I mentioned? 


Also, if I am indeed wrong and no such formula has been proved, is some good reason why it would be naive to expect one?


Thanks.



Exact formulas for the partition function?
This doesn't really answer the question, so perhaps it would be better as a comment, but alas, I don't have the necessary reputation.


Following up on Thomas Bloom's reference to the work of Bringmann and Ono, there is a paper of Folsom and Masri (Mathematische Annalen, available here: <http://www.math.yale.edu/~alf8/Folsom-Masri-MathAnn07-10.pdf>) which considers the main term one would get in an asymptotic formula arising from BO's Poincare series formula. In particular, they also consider the problem of the error arising from truncating the infinite sum at $O(n^{1/2})$, obtaining power savings over the best known results of $O(n^{-1/2+\epsilon})$ if one truncates at $\lfloor \sqrt{n/6} \rfloor$.


