A combinatorial proof of a general two-term recurrence

作者：Pang Sabrina X M; Lv Lun^*

来源：Ars Combinatoria, 2015, 118: 429-431.

• Stirling number
• Lah number
• recurrence
• combinatorial structure

We give a short combinatorial proof for the solution of a general two-term recurrence u(n, k) = u(n - 1, k - 1) + (a(n - 1) + b(k))u(n - 1, k), which was discovered by Mansour et al. [4].

• 出版日期2015-1
• 单位河北大学