On Solutions to a General Combinatorial Recurrence
Journal of Integer Sequences
Mathematics and Computer Science
This paper gives a partial solution to research problem 6.94 in Concrete Mathematics. It shows how to solve a large class of two-term combinatorial recurrence relations in terms of sums of binomial coefficients and the two kinds of Stirling numbers. Some known combinatorial identities involving named numbers (e.g., Stirling, Eulerian, Bell) are given a more unified treatment, and some new identities are proved.
Spivey, Michael Z.. 2011. "On solutions to a general combinatorial recurrence." Journal Of Integer Sequences 14(9): 119719.