answersLogoWhite

0

It is a version of the Fibonacci sequence, where each term is the sum of the previous two terms.

The sequence is defined by the recursive formula:

t(n) = t(n-1) + t(n-2) where t(n) is the nth term

Here, t(1) = 2 and t(2) = 3 though for the more general form of the Fibonacci sequence, t(1) = 1 and t(2) = 1.

User Avatar

Wiki User

13y ago

What else can I help you with?