Symbolization of generating functions; an application of the Mullin–Rota theory of binomial enumeration

We have found that there are more than a dozen classical generating functions that could be suitably symbolized to yield various symbolic sum formulas by employing the Mullin–Rota theory of binomial enumeration. Various special formulas and identities involving well-known number sequences or polynomial sequences are presented as illustrative examples. The convergence of the symbolic summations is discussed.