Tested tool guide
Tested browser tools
Checked August 16, 2026
What Recurrence Relation Solver does, with a checked example
Enter a linear recurrence with constant coefficients - a(n) = 3a(n-1) - 2a(n-2) - along with starting values, and the tool forms the characteristic equation, factors it, and returns a closed-form solution, a term-by-term table, and a graph of the sequence. Two things surprise people. First, the closed form is fitted to the exact initial values you typed: the same recurrence with different starting values produces a different formula. Second, a repeated root changes the shape of the answer, from A*r1^n + B*r2^n to (A + Bn)*r^n; that is the method working as intended, not an error.
Worked example
A concrete input and expected output from the current implementation.
Input
a(n) = 3a(n-1) - 2a(n-2), a(0) = 1, a(1) = 2
->
Expected output
Characteristic equation: x^2 - 3x + 2 = 0, roots 1 and 2. Closed form: a(n) = 2^n. Sequence: 1, 2, 4, 8, 16, 32, 64, ...
The roots 1 and 2 give the general form A*1^n + B*2^n; the initial values force A = 0 and B = 1, so a(n) = 2^n. Direct iteration agrees: a(2) = 3*2 - 2*1 = 4, matching 2^2.