How to turn non-recursive formulas into recursive formulas

Introduction

A sequence of numbers (often, but not always integers) can sometimes be described by a formula, if said numbers have a special pattern. These types of formulas can take one of two shapes:

1. A formula is said to be recursive if you must explicitly use previous value(s) in the sequence to determine the next value in the sequence. A typical example is the sequence which defines the Fibonacci numbers: F_n = F_{n — 1} + F_{n — 2}
2. A formula is said to be non-recursive if no…