Groups
Category
Exponential generating functions (EGFs) encode a sequence (a_n) as A(x) = \sum_{n \ge 0} a_n \frac{x^n}{n!}, which naturally models labeled combinatorial objects.
Stirling numbers of the first kind count permutations by their number of cycles and connect power polynomials to rising/falling factorials.