  We present a dual of a family of partition identities of Andrews involving
partitions with no repeated odd parts (among other conditions), along with an
overpartition generalization that encapsulates both families. These were
discovered during the course of research for an upcoming article by the authors
along with Debajyoti Nandi. The proof uses Appell's comparison theorem.

Combinatorics;Number Theory