Recurrence Relation

Explore RecurrenceRelation on MathWorld

A recurrence relation is a mathematical relationship expressing the members of a sequence as some combination of their predecessors.

Recurrence relation is a college-level concept that would be first encountered in a discrete mathematics course covering combinatorics.


Fibonacci Number: A member of the Fibonacci sequence. The Fibonacci sequence is generated by beginning with 1, 1, 2, 3 and continuing so that subsequent terms are the sum of the two previous numbers.

Classroom Articles on Combinatorics

  • Binomial Coefficient
  • Magic Square
  • Binomial Theorem
  • Pascal's Triangle
  • Combinatorics
  • Permutation
  • Generating Function

  • Classroom Articles on Discrete Mathematics (Up to College Level)

  • Algorithm
  • Graph
  • Binary
  • Graph Cycle
  • Chromatic Number
  • Graph Theory
  • Complete Graph
  • Logic
  • Connected Graph
  • Planar Graph
  • Cycle Graph
  • Polyhedral Graph
  • Directed Graph
  • Tree
  • Discrete Mathematics