Abstract

In this paper, we give explicit formulas for elements of the Fibonacci, and Lucas Pascal triangles. The structure of these objects and Pascal's original triangle coincide. Keeping the rule of addition, we replace both legs of the Pascal triangle by the Fibonacci sequence, and the Lucas sequence, respectively. At the end of the study we describe how to determine such a formula for any binary recurrence $\{G_n\}^{\infty}_{n=0}$ satisfying $G_n=G_{n−1}+G_{n−2}$. Other scattered results are also presented.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call