Adds up nC0 + nC1 + … + nCn, the sum of row n of Pascal's triangle. It always equals 2ⁿ, the number of subsets of an n-element set.