Stepping Stone 8: Explicit Form of a Recursive Sequence

PC.F-BF.A.2: Write arithmetic and geometric sequences both recursively and with an explicit formula, use them to model situations, and translate between the two forms.

PC.F-IF.A.3: Recognize that sequences are functions, sometimes defined recursively, whose domain is a subset of the integers. For example, the Fibonacci sequence is defined recursively by f(0) = f(1) = 1, f(n+1) = f(n) + f(n-1) for n ? 1 (n is greater than or equal to 1).

Represent arithmetic and geometric sequences recursively.

Determine the explicit form of a recursive sequence.

How do recursive formulas help us predict where numbers are trending?

Recursive sequence

Explicit form