Andrews, Lewis and Lovejoy introduced the partition functions PD(n) and PDO(n) defined by the number of partitions of n with designated summands and the number of partitions of n with designated summands in which all parts are odd, respectively. They found several generating function identities and congruences modulo 3, 4, and 24 satisfied by the functions. In this paper, we find generating function identities and congruences modulo 4, 9, 12, 36, 48, and 144 for PD3(n), which represents the number of partitions of n with designated summands, whose parts are not divisible by 3.
展开▼
