Enumerative combinatorics - Wikipedia, the free encyclopedia

or the exponential generating function Often, a complicated closed formula yields little insight into the behavior of the counting function as the number of counted objects grows. In these cases, a simple asymptotic approximation may be preferable. A func

en.wikipedia.org