M.1HS.14: 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.

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.

Example Videos
Example Problems

and


Find the 5th term in the sequence.

and


Find the 5th term in the sequence.

and


Find the 5th term in the sequence.
Khan Academy Resources
Goblins

1-on-1 tutoring aligned to M.1HS.14. Instant help for students, real-time insights for teachers.

Used in classrooms by 100,000+ students at Baltimore County, Plano ISD, Deer Valley USD, KIPP, and districts nationwide.

Free for teachers, forever →