  We give an asymptotic estimate for the number of partitions of a set of $n$
elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers.
As an application, we derive an estimate for the number of partitions of a set
with $n$ elements, which have the property that its blocks can be combined to
form subsets of any size between $1$ and $n$.
