Bressoud, David M. A combinatorial proof of Schur’s 1926 partition theorem. (English) Zbl 0443.05009 Proc. Am. Math. Soc. 79, 338-340 (1980). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 5 ReviewsCited in 23 Documents MSC: 05A17 Combinatorial aspects of partitions of integers 11P81 Elementary theory of partitions Keywords:theorem of Schur; partitions × Cite Format Result Cite Review PDF Full Text: DOI Online Encyclopedia of Integer Sequences: Schur’s 1926 partition theorem: number of partitions of n into parts 6n+1 or 6n-1.
