STANDARD 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. |

WORKSHEETS |
Regents-Sequences 1a
A2
*difference or ratio, MC* |
10 |
TST
PDF
DOC
TNS |

Regents-Sequences 1b
A2
*difference or ratio, bimodal* |
TST
PDF
DOC |

Regents-Sequences 2a
AI/A2
*term, MC* |
3/10 |
TST
PDF
DOC
TNS |

Regents-Sequences 2b
AI/A2
*term, bimodal* |
TST
PDF
DOC |

Practice-Sequences 1
*find difference/ratio* |
10 |
WS
PDF |

Practice-Sequences 2
*find term* |
10 |
WS
PDF |

Practice-Sequences 3
*find term* |
12 |
WS
PDF |

Journal-Sequences |
2 |
WS
PDF |

LESSON PLAN |
Define Sequences as Functions |
PDF
DOC |

VIDEOS |
Finding the common difference of an
arithmetic sequence |
VID |

Finding the value of the nth term of
an arithmetic sequence |
VID |

Finding the value of the nth term of
geometric sequence |
VID |

Using geometric sequences to model
real-world situations |

Using the recursive formula to
generate patterns |
VID |

Using the explicit formula to
generate patterns |

Finding the value of the nth term of
an arithmetic sequence |
VID |

Using the arithmetic mean |

Finding the value of the nth term of
a geometric sequence |
VID |

Using the geometric mean |