Recursive Sequence Calculator

Enter the coefficients, seed values, and term count to generate the sequence.

How to use

  1. Enter your values in the fields above.
  2. Press Calculate to see your result instantly.
  3. Use the Share button to copy a link to your result.

About this calculator

A second-order linear recurrence defines each term from the two before it: a(n) = p·a(n-1) + q·a(n-2) + r. Set p=q=1, r=0 and seed with 0,1 and you get the Fibonacci sequence; different coefficients generate Lucas numbers, Pell numbers, and countless other classic sequences.

Recurrences like this appear throughout computer science and mathematics — analyzing the running time of recursive algorithms, modeling population growth, and describing digital filters in signal processing — because many real processes depend on their two most recent states rather than an explicit formula for the n-th term.

Was this helpful?

Comments (0)

  • Be the first to comment.

Popular calculators

All Calculators