  Motivated by Andrews' recent work related to Euler's partition theorem, we
consider the set of partitions of an integer $n$ where the set of even parts
has exactly $j$ elements, versus the set of partitions of $n$ where the set of
repeated parts has exactly $j$ elements. These two sets of partitions turn out
to be equinumerous, and this naturally encloses Euler's theorem and Andrews'
theorem as two special cases. We give two proofs, one using generating
function, and the other is a direct bijection that builds on Glaisher's
bijection
