Convolutive Sequences, I: Through the Lens of Integer Partition Functions

Motivated by the convolutive behavior of the counting function for partitions with designated summands in which all parts are odd, we consider coefficient sequences (an)n≥0 of primitive eta-products that satisfy the generic convolutive property ∑n≥0amnqn=(∑n≥0anqn)m for a specific positive integer m. Given the results of an exhaustive search of the Online Encyclopedia of Integer Sequences for such sequences for m up to 6, we first focus on the case where m=2 with our attention mainly paid to the combinatorics of two 2-convolutive sequences, featuring bijective proofs for both. For other 2-convolutive sequences discovered in the OEIS, we apply generating function manipulations to show their convolutivity. We also give two examples of 3-convolutive sequences. Finally, we discuss other convolutive series that are not eta-products.