On the generating functions for partitions with repeated smallest part

Abstract

We consider the number of integer partitions whose smallest part is repeated exactly k times and the remaining parts are not repeated. We prove that their generating functions are linear combinations of the q-Pochhammer symbols with polynomials as coefficients. Focusing on the cases $k=1,2$, and 3, we derive new identities and inequalities for the partitions into distinct parts.