HSF.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) + (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) + (n − 1) for n ≥ 1.

Example Problems


Find the fourth term in the sequence.


Find the 8th term in the sequence.


Find the 16th term in the sequence.
Khan Academy Resources
Intro to arithmetic sequencesIntro to arithmetic sequence formulasGeometric sequences reviewUse arithmetic sequence formulasExtend geometric sequencesUse geometric sequence formulasExtend arithmetic sequencesRecursive formulas for geometric sequencesExtend geometric sequences: negatives & fractionsIntro to arithmetic sequencesIntro to geometric sequencesArithmetic sequence problemSequences and domainUsing recursive formulas of geometric sequencesWorked example: using recursive formula for arithmetic sequenceExtending geometric sequencesUsing arithmetic sequences formulasUsing explicit formulas of geometric sequencesExtending arithmetic sequences
Goblins

1-on-1 AI tutoring aligned to HSF.IF.A.3. 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 →