Enumerative combinatorics

Area of combinatorics that deals with the number of ways certain patterns can be formed

Enumerative combinatorics is an area of combinatorics that deals with the number of ways that certain patterns can be formed. Two examples of this type of problem are counting combinations and counting permutations. More generally, given an infinite collection of finite sets Si indexed by the natural numbers, enumerative combinatorics seeks to describe a counting function which counts the number of objects in Sn for each n.

From Wikipedia, under CC BY-SA. More on occurri.