Abstract
In this article, we consider some generalizations of Fibonacci numbers. We consider k-Fibonacci numbers (that follow the recurrence rule F k,n + 2 = kF k,n + 1 + F k,n ), the (k,ℓ)-Fibonacci numbers (that follow the recurrence rule F k,n + 2 = kF k,n + 1 + ℓF k,n ), and the Fibonacci p-step numbers (, with , and p > 2). Then we provide combinatorial interpretations of these numbers as square and domino tilings of n-boards, and by easy combinatorial arguments Honsberger identities for these Fibonacci-like numbers are given. While it is a straightforward task to prove these identities with induction, and also by arithmetical manipulations such as rearrangements, the approach used here is quite simple to follow and eventually reduces the proof to a counting problem.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Mathematical Education in Science and Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
