The Number of Partitions with a Given Largest Part
The Number of Partitions with a Given Largest Part
The number is the number of ways of partitioning into parts with largest part . This is the same as partitioning into exactly parts. The function satisfies the recurrence relation . Move the slider to see the diagonal-by-diagonal construction of the table.
P(n,k)
n
k
n
k
P(n,k)=P(n-1,k-1)+P(n-k,k)