Content deleted Content added
→Definition and properties: improve formatting and referencing, cut down on junk |
→Example values of strict partition numbers: no real need for a section heading or this sentence fragment |
||
Line 132:
A partition in which no part occurs more than one is called ''strict'', or is said to be a partition ''into distinct parts''. The function ''q''(''n'') gives the number of these strict partitions of the given sum ''n''. For example, ''q''(3) = 2 because the partitions 3 and 2 + 1 are strict, while the third partition 1 + 1 + 1 of 3 has repeated parts. The number ''q''(''n'') is also equal to the number of partitions of ''n'' in which only odd summands are permitted.<ref>{{cite book|first=Richard P.|last=Stanley|author-link=Richard P. Stanley|title=Enumerative Combinatorics 1 |series=Cambridge Studies in Advanced Mathematics|volume=49|publisher=Cambridge University Press|isbn=0-521-66351-2 |year=1997|loc=Proposition 1.8.5}}</ref>
{| class="wikitable"
|+ Example values of q(n) and associated partitions
Line 182 ⟶ 179:
|......
|}
=== MacLaurin series ===
The corresponding generating function based on the [[MacLaurin series]] with the numbers q(n) as coefficients in front of x<sup>n</sup> is as follows:
| |||