This presentation investigates a recursively defined number triangle that generalizes classical structures such as Pascal’s and Fibonacci’s triangles. The first diagonal is constant, while subsequent diagonals are generated using patterns related to Fibonacci and triangular numbers. A central result of this study is the discovery that all 5×5 matrices along the left side of the triangle have a determinant of 2. This matrix captures the recursive structure of the triangle and provides a systematic way to describe how entries depend on one another. Closed-form expressions for the third and fourth diagonals are derived to support and justify the matrix representation. This work demonstrates how matrix methods offer a new framework for understanding generalized number triangles and their connections to classical sequences.