Abstract
Euler's classical identity states that the number of partitions of an integer into odd parts and distinct parts are equinumerous. Franklin gave a generalization by considering partitions with exactly different multiples of , for a positive integer . We prove an analogue of Franklin's identity by studying the number of partitions with multiples of in total and in the process, discover a natural generalization of the minimal excludant (mex) which we call the -chain mex. Further, we derive the generating function for , the sum of -chain mex taken over all partitions of , thereby deducing a combinatorial identity for , which neatly generalizes the result of Andrews and Newman for , the sum of mex over all partitions of .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.