In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called partitions with designated summands. These are constructed by taking unrestricted integer partitions and designating exactly one of each occurrence of a part. In the same work, they also considered the restricted partitions with designated summands wherein all parts must be odd, and they denoted the corresponding function by $\mathrm{PDO}(n)$.