Content deleted Content added
almost entirely cs2, standardize on that |
Tag: Reverted |
||
Line 50:
<!-- Note: The following is the same formula as in the source, but in a more compact form. See [[Talk:Partition function (number theory)#Recurrence relations]]. -->
<math display="block">\begin{align}
p(n) &= \sum_{k \in \Z\setminus\{0\}} (-1)^{k+1} (p(n-k(3k-1)/2) + p(n-k(3k+1)/2)) \\
&= p(n-1) + p(n-2)-p(n-5)-p(n-7) +p(n-12) +p(n-15) - p(n-22) -\cdots
\end{align}</math>
| |||