In this lesson, students work on recursive formulas, building on the ideas that were introduced in Module 1, Lessons 26
and 27 (i.e., the double and add 5 game).
RECURSIVE SEQUENCE: An example of a recursive sequence is a sequence that (1) is defined by specifying the values of one or more initial terms and (2) has the property that the remaining terms satisfy a recursive formula that describes the value of a term based upon an expression in numbers, previous terms, or the index of the term. An explicit formula specifies the 𝒏 th term of a sequence as an expression in 𝒏. A recursive formula specifies the 𝒏 th term of a sequence as an expression in the previous term (or previous couple of terms).
There may be cases when our downloadable resources contain hyperlinks to other websites. These hyperlinks lead to websites published or operated by third parties. UnboundEd and EngageNY are not responsible for the content, availability, or privacy policies of these websites.