✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
Other scattered results are also presented.
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this paper, we give explicit formulas for elements of the Fibonacci, and Lucas Pascal triangles.
📊
Key Findings & Data: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}$.
💡
Conclusion & Impact:Other scattered results are also presented.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Generalized Pascal's triangle · Fibonacci sequence · Lucas sequence
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.
🔖
Cite This Article
BELBACHİR, H., SZALAY, L. (2022). Fibonacci, and Lucas Pascal triangles. Hacettepe Journal of Mathematics and Statistics, Cilt: 45 - Sayı: 5, 1343–1354. https://ajindex.com/articles/530034