Standard Alignments:

TEKS Math: A1.12.C

(C) Identify terms of arithmetic and geometric sequences when the sequences are given in function form using recursive processes

AU Math: ACMNA133

(Y6) Continue and create sequences involving whole numbers, fractions and decimals. Describe the rule used to create the sequence (ACMNA133)

CCSS Math: HSF.IF.3

HSF.IF.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.