THE NUMBER OF PATHS IN BOUNDARY RESTRICTED PASCAL TRIANGLE

In this talk, we provide several forms of the generator for counting the number of paths in the boundary restricted Pascal triangle. In the section 1, we consider the problem of single boundary. In the section 2, we proceed the discussion into the problem of two boundaries. Specifically, we give three seemingly different forms to count the number of paths. If time permits, we will give the proof of the equivalence between them. The study treated in the paper is a continuation of papers [2, 3].