  Integer partitions are one of the most fundamental objects of combinatorics
(and number theory), and so is enumerating objects avoiding patterns. In the
present paper we describe two approaches for the systematic counting of classes
of partitions avoiding an arbitrary set of "patterns".
