Schur's partition theorem states that for each nonnegative
integer, where counts the partitions of
into parts congruent to (mod 6), counts the partitions into
distinct parts congruent to (mod 3), and counts the partitions into
parts that differ by at least 3, with the added constraint that two multiples of
3 differ by at least 6 (Schur 1926; Bressoud 1980; Andrews 1986, p. 53). All
parts are positive integers, and the empty partition gives .
The values of
for , 2, ... are 1, 1, 1, 1, 2, 2, 3, 3, 3, 4, 5, 6, 7,
8, 9, 10, 12, 14, 16, 18, ... (OEIS A003105).
For example, for ,
there are nine partitions satisfying these conditions,
as summarized in the following table (Andrews 1986, p. 54).
Andrews, G. E. "q-Series and Schur's Theorem" and "Bressoud's Proof of Schur's Theorem." §6.2-6.3 in q-Series:
Their Development and Application in Analysis, Number Theory, Combinatorics, Physics,
and Computer Algebra. Providence, RI: Amer. Math. Soc., pp. 53-58, 1986.Bressoud,
D. M. "A Combinatorial Proof of Schur's 1926 Partition Theorem." Proc.
Amer. Math. Soc.79, 338-340, 1980. https://doi.org/10.1090/S0002-9939-1980-0565367-X.Schur,
I. "Über die Kongruenz (mod )." Jahresber. Deutsche Math.-Verein.25,
114-116, 1916.Schur, I. "Zur additiven Zahlentheorie." Sitzungsber.
Preuss. Akad. Wiss. Phys.-Math. Kl., pp. 488-495, 1926. Reprinted in Gesammelte
Abhandlungen, Vol. 3. Berlin, Germany: Springer-Verlag, pp. 43-50,
1973.Sloane, N. J. A. Sequence A003105/M0254
in "The On-Line Encyclopedia of Integer Sequences."