What is the number of ways of partitioning a positive number $k\leq mn$ using non-increasing parts such that the number of parts can be at most $n$ and the value of each part can be at most $m$?
Partition function with restrictions
2
$\begingroup$
integer-partitions