Abstract
The number of partitions of n wherein even parts are distinct and odd parts are unrestricted, often denoted by ped(n), has been the subject of many recent studies. In this paper, the author provides an efficient linear recurrence relation for ped(n). A simple criterion for deciding whether ped(n) is odd or even is given as a corollary of this result. Some connections with partitions into parts not congruent to 2(mod4), overpartitions and partitions into distinct parts are presented in this context.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
