 Stirling numbers and exponential generating functions in symbolic combinatorics

The use of exponential generating functions (EGFs) to study the properties of Stirling numbers is a classical exercise in combinatorial mathematics and possibly the canonical example of how symbolic combinatorics is used.It also illustrates the parallels in the construction of these two types of numbers, lending support to the binomial-style notation that is used for them.