Restricted k-color partitions

We generalize overpartitions to (k, j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems: generating function dissections, modular forms, bijections, and other combinatorial maps. In the process of proving certain congruences, we find results of independent interest on the number of partitions with exactly 2 sizes of part in several arithmetic progressions. We find connections to divisor sums, the Han/Nekrasov–Okounkov hook length formula and a possible approach to finitization, and other topics, suggesting that a rich mine of results is available. We pose several immediate questions and conjectures.