A Generalization of Pascal’s Triangle

Combinatorics is a branch of mathematics interested in the study of finite, or countable, sets. In particular, Enumerative Combinatorics is an area interested in counting how many ways patterns are created, such as counting permutations and combinations. Brenti and Welker, authors of “The Veronese Construction for Formal Power Series and Graded Algebras,” seek an explanation for a combinatorial identity posed in their research. Using techniques practiced in this area of mathematics, we have discovered that certain numbers appearing in their identity hold properties similar to properties of the well-known binomial coefficients