All partitions of 5:

Partitions of 5 involving at most 3 terms:

Partitions of 5 involving at least 3 terms:

All partitions of 8:

Partitions of 8 into at most 3 integers:

Equivalently:

Partitions of 8 into exactly 3 integers:

Find partitions of 8 of even length only:

Find all partitions of 8 that involve only 1, 2, and 5:

Find the first 10 partitions of 15:

Find the last 3 partitions of 15:

Find ways to form 3 from combinations of rational numbers:

Find partitions involving negative numbers:

Find the ways to make change for 156 cents with 10 or fewer standard coins:

Find "McNugget partitions" for 50:

Find the number of "McNugget partitions" for numbers up to 50:

Show integers that are not "McNuggetable":

The last case is exactly the corresponding Frobenius number:

Each sublist adds up to the original number:

The length of IntegerPartitions[n] is PartitionsP[n]:

IntegerPartitions gives results in reverse lexicographic order, not Sort order:

For integers below 10, generate IntegerPartitions order by converting to strings:

FrobeniusSolve gives coefficient lists for IntegerPartitions:

IntegerPartitions cannot give an infinite list of partitions:

There are no integer partitions of 1/2:

There are, however, partitions into rationals:

If all items requested by the fourth argument are not present, a warning message is issued:

To suppress the message, use Off: