A set partition is called “gap-free” if its block sizes form an interval. In other words, there is at least one block of each size between the smallest and largest block sizes. Let B(n) and G(n), respectively, denote the number of partitions and the number of gap-free partitions of the set [n]. We prove that