Title

On Solutions to a General Combinatorial Recurrence

Document Type

Article

Publication Date

2011

Publication Title

Journal of Integer Sequences

Department

Mathematics and Computer Science

Abstract

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.

Volume

14

Issue

9

pp.

119719

ISSN

1530-7638