No label defined (Q4340259)

Let \(\{a(n)\}^\infty_{n=0}\) and \(\{b(k)\}^\infty_{k=0}\) be two given sequences with \(a(0)= b(0)\). Further let \(\{L(n,k)\}\) be an array satisfying the recurrence relation \(L(n,k)= L(n-1,k-1)- L(n,k-1)\) with initial values \(L(n,0)= a(n)\) and \(L(0,k)= b(k)\) for any \(n, k\geq 0\). The author gives an expresssion for \(L(n,k)\) in terms of the initial values using the method of generating functions. He proves that \[ L(n,k)= \sum^k_{i=0} {k\choose i}(-1)^{k-i} a(n-i)+ \sum^{k-1}_{j=n}{j\choose n}(-1)^{j-n}[b(k-j)- b(k-j-1)] \] for any \(n, k\geq 0\).