A Combinatorial Proof of a General Two-Term Recurrence

Abstract

We provide a concise combinatorial proof for the solution of the general two-term recurrence $u(n,k)=u(n-1,k-1)+(a_{n-1}+b_k)u(n-1,k)$, initially discovered by Mansour et al. $[4]$.