Abstract
We develop a recurrence satisfied by the Fibonacci and Pell families. We then use it to find explicit formulae and generating functions for the hybrids F n P n , L n P n , F n Q n and L n Q n , where F n , L n , P n and Q n denote the nth Fibonacci, Lucas, Pell and Pell–Lucas numbers, respectively. The recurrence enables us to find such relations for and .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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 callMore From: International Journal of Mathematical Education in Science and Technology
Paper Title
Journal
Date
