A partition of n is a decomposition of n into a sum of positive integers. So the 5 partitions of 4 are
![](//static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20170915061848823-0667:S0025557200189983:S0025557200189983_inline2.gif?pub-status=live)
The number of partitions of n is written p(n) and (with the convection that p(0) = 1) the sequence p(0), p(1), p(2), ... begins
1, 1, 2, 3, 5, 7, 11, 15,....