| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 473720 | Computers & Mathematics with Applications | 2007 | 15 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Tian-Xiao He, Leetsch C. Hsu, Peter J.-S. Shiue,