A cover of a finite set \(N\) is a collection of subsets of \(N\) whose union is \(N\). We determine the number of such covers whose blocks all have distinct sizes. The cases of unordered and ordered blocks are each considered.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.