Definition
A first-order recurrence relation defines each new term of a sequence using the immediately preceding term and, optionally, the term index.
Interpretation
The general form states that the next term is obtained by applying a specified function to the current term and its index. A common special case is a linear recurrence with constant coefficients.
Mathematical Significance
Recurrence relations describe sequences generated step by step and are fundamental in discrete mathematics, algorithms, population models, and numerical processes.
Special Cases
If a_(n+1) = a_n + d, the sequence is arithmetic.
If a_(n+1) = ra_n, the sequence is geometric.
If a_(n+1) = ra_n + c, the recurrence is first-order linear with constant coefficients.
If r = 1 in the linear form, the sequence increases by the constant c at each step.