Question

One way of generalizing the fibonacci sequence is by starting with any pair of numbers and extending to negative values of n

Answer 1

Answer:

In mathematics, the Fibonacci numbers form a sequence defined recursively by:

F0 = 0

F1 = 1

Fn = Fn − 1 + Fn − 2, for integer n > 1.

That is, after two starting values, each number is the sum of the two preceding numbers.

The Fibonacci sequence has been studied extensively and generalized in many ways, for example, by starting with other numbers than 0 and 1, by adding more than two numbers to generate the next number, or by adding objects other than numbers.