Fast computation of the partition function

In this paper, the author provides a method to compute the values of Euler's partition function p(n)p(n) that requires only the values of p(k)p(k) with k⩽n/2k⩽n/2. This method is combined with Ewell's recurrence relation for the partition function p(n)p(n) to obtain a simple and fast computation of the value of p(n)p(n).