Abstract
Horadam introduced a generalized sequence of numbers, describing its key features and the special sub-sequences obtained from specific choices of initial parameters. This sequence and its sub-sequences are known as the Horadam, generalized Fibonacci, and generalized Lucas numbers, respectively. In the present study, we propose another new sequence, which satisfies a second-order recurrence relation. Further, we prove the Binet’s formula, some famous identities, and summation formulas for this new sequence. In particular, we demonstrate the interrelationships between our new sequence and the Horadam sequence.
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 callDisclaimer: 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.
