Euler's Pentagonal Numbers Theorem/Corollary 2

Theorem
Let $n \in \Z_{>0}$ be a strictly positive integer.

Let $\map p n$ denote the number of partitions on $n$.

Then:
 * $\map p n = \displaystyle \sum_{1 \mathop \le n - GP_k \mathop < n} -\paren {-1}^{\ceiling {k / 2} } \map p {n - GP_k} + \sqbrk {\exists k \in \Z: GP_k = n}$

where:
 * $\ceiling {k / 2}$ denotes the ceiling of $k / 2$
 * $GP_n$ denotes the $n$th generalized pentagonal number
 * $\sqbrk {\exists k \in \Z: GP_k = n}$ is Iverson's convention.