Generate Numerical Partitions

What Type?   (pick one)
All partitions of n [into k parts] [with largest part m]
Partitions of n in Gray Code order [with largest part m]
Partitions of n into distinct parts [with largest part m]
Partitions of n into odd parts [with largest part m]
Partitions of n into odd distinct parts [with largest part m]
Binary partitions of n [with no part used more than k times]
Score sequences of tournaments on n vertices
Graphical partitions [with largest part at most k]
Degree Sequences [with connectivity k = 0, 1, or 2]

Input   (value 0 < n <= 50 required)
n =
k =
m =

Output   (pick one or more)
Natural representation
Multiplicity representation
Ferrers Diagram
Show corresponding partition under natural bijection (see Notes below).
Show Gray code changes (if applicable)

Notes:


It was last updated .