Content deleted Content added
→MacLaurin series: massive cleanup, logical presentation, +1 decent source |
m →Generating function: consistent variables |
||
Line 182:
=== Generating function ===
The generating function for the numbers ''q''(''n'') is given by a simple infinite product:<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|at=Proof of Proposition 1.8.5}}</ref>
<math display="block">\sum_{
where the notation <math>(a;b)_{\infty}</math> represents the [[Pochhammer symbol]] <math>(a;b)_{\infty} = \prod_{k = 0}^{\infty} (1 - ab^{k}).</math> From this formula, one may easily obtain the first few terms {{OEIS|A000009}}:
<math display="block">\sum_{
This series may also be written in terms of [[theta function]]s as
<math display="block">\sum_{
where
<math display="block">\vartheta_{00}(x) = 1 + 2\sum_{n = 1}^{\infty} x^{n^2}</math>
Line 192:
<math display="block">\vartheta_{01}(x) = 1 + 2\sum_{n = 1}^{\infty} (-1)^{n} x^{n^2}.</math>
In comparison, the generating function of the regular partition numbers ''p''(''n'') has this identity with respect to the theta function:
<math display="block">\sum_{
=== Identities about strict partition numbers ===
|