University of California, San Diego: Edward Bender and S. Williamson's "Lists, Decisions and Graphs: Decision Trees and Recursion"

A simple example of going from an iterative relation to a formula is as follows: given the iterative relation, an = arn , arn, = r a r n-1 = r a n - 1, . Continuing in this manner, we get the formula, an = rn a0.

For another example, read over Exercise 4.7 on page DT-51. It discusses going from an iterative sequence to a recursive solution/equation, and vice versa, from the recursive equation to an iterative sequence.

Click https://s3.amazonaws.com/saylordotorg-resources/wwwresources/site/wp-content/uploads/2011/09/CS202-Decision-Trees-and-Recursion-DT-Edward-Bender.pdf link to open resource.