partition of a set

A partition of a set $X$ is a set of non-empty subsets $P_i\subseteq X$ such that every element $x\in X$ is in exactly one subset. Equivalently, the subsets $P_i$ are all non-empty disjoint sets which cover $X$.

The Bell number $B_n$ counts the possible partitions of an $n$-element set.