LAUSR

Abstract The number of partitions of n wherein even parts are distinct and odd parts are unrestricted, often denoted by p e d ( n ) , has been the subject of many recent studies. In this paper, the author provides an efficient linear recurrence relation for p e d ( n ) . A simple criterion for deciding whether p e d ( n ) is odd or even is given as a corollary of this result. Some connections with partitions into parts not congruent to 2 ( mod 4 ) , overpartitions and partitions into distinct parts are presented in this context.