Skip to content

IntegerPartitions

The partitions of into positive parts, as a lazy indexed family.

IntegerPartitions(n)every way to write as a sum of positive parts, order-insensitive.

Domain: Collections

Details
  • A lazy indexed collection, unranked in reverse-lexicographic order; the count is the partition number — with no elementary closed form.
  • Each element is the part list in weakly decreasing order; drawn as a Ferrers diagram, its statistics (Length, LargestPart, DurfeeSquare, …) live in .
  • Conjugation (transposing the diagram) is an involution; the self-conjugate partitions of equal the partitions of into distinct odd parts.

Enumeration

See also: Count, At, Length