A linear recurrence is one in which an is expressed as a sum of functions of n times values of (some of the terms) a_i for i < n plus (perhaps) another function (called the driving function) of ...A linear recurrence is one in which an is expressed as a sum of functions of n times values of (some of the terms) a_i for i < n plus (perhaps) another function (called the driving function) of n. A linear equation is called homogeneous if the driving function is zero (or, in other words, there is no driving function). It is called a constant coefficient linear recurrence if the functions that are multiplied by the a_i terms are all constants (but the driving function need not be constan
