The recursive formula for the Fibonacci sequence states the first two terms and defines each successive term as the sum of the preceding two terms. Tap for more steps. A recursive formula specifies the nth term of a sequence as an expression in the previous.
In this case adding to the previous term in the sequence gives the next term.
The calculator will generate all the work with detailed explanation. All solutions to the recurrence relation a n 1 s a n t with s 1 have the form. Recursive formulas are based on the previous term of the sequence. A n c 1 s n c 2 where c 1 and c 2 are specific constants.