Abstract

In this paper we study those n-color partitions of Agarwal and Andrews, 1987, in which each pair of parts has weighted difference equal to −2 Results obtained in this paper for these partitions include several combinatorial identities, recurrence relations, generating functions, relationships with the divisor function and computer produced tables. By using these partitions an explicit expression for the sum of the divisors of odd integers is given. It is shown how these partitions arise in the study of conjugate and self-conjugate n-color partitions. A combinatorial identity for self-conjugate n-color partitions is also obtained. We conclude by posing several open problems in the last section.