Skip to content
Allin

Recurrence relation solver

Generate the sequence of any linear recurrence a(n) = c₁·a(n−1) + … + cₖ·a(n−k). Enter the coefficients and the matching initial values, and it unrolls the sequence term by term — Fibonacci, Lucas, Pell and any custom order-k relation you define, with decimals and negatives supported.

Absolute Value Equation SolverSolve absolute-value equations like |x+3| = 5, 3|x+2| = 12 or |x+1| = |x−3| with step-by-step case analysis and exact solutions.Absolute Value Inequality SolverSolve absolute-value inequalities such as |x+3| < 5 or |x−2| > 3 and get the solution as an interval, with AND/OR reasoning explained step by step.Bernoulli ODE SolverSolves y′ + P(x)y = Q(x)yⁿ by showing the substitution v = y^(1−n) that turns it into a linear equation, then integrating. The two degenerate cases are handled explicitly: n = 0 is already linear, n = 1 is separable.Cubic Equation SolverSolve ax³ + bx² + cx + d = 0 for all three roots (real and complex), with the discriminant, the nature of the roots and steps.Exponential Equation SolverSolve exponential equations of six types — basic, coefficient, linear exponent, two bases, quadratic-in-a^x and shifted — with logarithms and a full step-by-step solution.First-Order ODE SolverSolves dy/dx = f(x, y) from an initial condition with RK4, integrating outward in both directions, and plots the solution curve. Growth, decay, Newton cooling, logistic and separable cases are one click away.General Triangle SolverSolve any triangle from 3 known values (SSS, SAS, ASA/AAS, SSA) with the laws of sines and cosines: all sides and angles, area, perimeter and type, handling the ambiguous SSA case (0, 1 or 2 triangles).Inequality SolverSolve linear, quadratic and rational inequalities such as x^2-5x+6>0 or (x+2)/(x-1)>0 with a full sign chart and the solution set in interval notation.

Recurrence relation solver is free to use as often as you like, directly from this page. You will find it under Sequences & series, with Absolute Value Equation Solver and Absolute Value Inequality Solver for the neighbouring cases.

How to use it

  1. Open the tool — no signup or install needed.
  2. Enter your input or adjust the available options.
  3. Get your result instantly, then copy or download it.

Frequently asked questions

What does Recurrence relation solver do?

Generate the sequence of any linear recurrence a(n) = c₁·a(n−1) + … + cₖ·a(n−k). Enter the coefficients and the matching initial values, and it unrolls the sequence term by term — Fibonacci, Lucas, Pell and any custom order-k relation you define, with decimals and negatives supported.

What does a concrete case look like?

aₙ = aₙ₋₁ + aₙ₋₂, a₀ = 0, a₁ = 1 → Fibonacci, a₁₀ = 55 — the tool shows every step in between, not just the final figure.

When would I actually use this?

Finding the nth term without listing every one before it, summing a long run in one step, and recognising which family a sequence belongs to.

What is the most common mistake?

Starting the index at the wrong end. Whether the first term is a₀ or a₁ shifts every result by one position, and the two conventions are both common.

What else is filed next to it?

Absolute Value Equation Solver, Absolute Value Inequality Solver and Bernoulli ODE Solver share its section. They are not variants of it — being filed together is not the same as being alike — but that is where to look if this turned out not to be the tool you wanted.

Where do the figures come from?

The closed forms are the standard ones, and the tool states the indexing convention it uses so a result can be compared against a textbook without ambiguity.

Further reading

All guides