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[subscript n]P[subscript n]", "L[subscript n]P[subscript n]", "F[subscript n]Q[subscript n]" and "L[subscript n]Q[subscript n]", where "F[subscript n]", "L[subscript n]", "P[subscript n]" and "Q[subscript n]" denote the "n"th Fibonacci, Lucas, Pell and Pell-Lucas numbers, respectively. The recurrence enables us to find such relations for [image omitted] and [image omitted].