User blog comment:Qwertyxp2000 the second/Learning the pascal triangle through the monster elements/@comment-7326455-20151217001355

The number of ways to pick K things from a set of N of them is always the Nth row of Pascal's triangle - it's only a coincidence in that the derivation of Pascal's triangle happens to match the combination equation, but it's not a coincidence that the number of monsters with K elements do. I've made that obvervation here once or twice in the past. =P