Abstract
In this paper we consider the general two‐dimensional recursion g(n + 1, r + 1) = g(n + 1, r) + bg(n, r) + g(n, r + 1) with boundary conditions g(n, 0) = g(0, r) = 1 We develop various exact and asymptotic formulas for the g(n, r).

This publication has 2 references indexed in Scilit: