  We prove a lemma that is useful to get upper bounds for the number of
partitions without a given subsum. From this we can deduce an improved upper
bound for the number of sets represented by the (unrestricted or into unequal
parts) partitions of an integer n.
