Answers are grounded in this paper and cite their sources.
Th e fun c ti on g (n, m , h , k) , whi c h enumerates the number of partitions of n into exactly k s um mand s eac h le ss than or e qual to m and in which th e number of different summands is exactly h, is he re tabu lated and studied.
No takes yet. Share an insight, caveat, or question.
Hansraj Gupta (1969) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: