In what follows, Pm(n) denotes the number of those partitions of n in which the smallest element is m; pm(n) the number of those in which m is the largest element, i.e. the number of partitions of n into exactly m non-zero parts; and p(n) denotes the number of unrestricted partitions of n.