An Algorithm for Calculating Terms of a Number Sequence using an   Auxiliary Sequence
  Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is derived for calculating the nth term even without an expression in closed form. 
Bengt M{\aa}nsson
math.NT