Recurrence relations

sequence or array in which each further term is defined as a function of the preceding terms

number in the Lucas sequence where each number is the sum of the two preceding it (2, 1, 3, 4, 7, 11, ...)

denominator of close rational approximation to the square root of 2

method for analysis of algorithms

integer sequence in which each member of the sequence is the product of the previous members, plus one

Number sequence 3,0,2,3,2,5,5,7,10,... defined by recurrence relation P(n) = P(n-2) + P(n-3).

integer that appears as a term in a linear recurrence relation with initial terms based on its own digits

one of certain constant-recursive integer sequences

sequence of integers

parameter in differential equations and dynamical systems

one part of a particular Lucas sequence

endless sequence

on divide and conquer algorithms where the sub-problems have substantially different sizes

one of a set of numbers that Dijkstra used to explain smoothsort

sequence satisfying a homogeneous linear recurrence with constant coefficients

relation in algebra

recurrence equation on a function space, that involves integration

recursive functions studied in computer science

the unification of the theory of difference equations with differential equations

sequence hypothesized to always terminate at 1

assignment problem in combinatorial mathematics