Back to Recognize sequences as functions — Problem 3 · Task Set 5

HSF.IF.A.3 Tutor Intake — Sequences as Functions

This short check helps your tutor understand where to start. Answer each question on your own. If you are not sure, give your best try — every response helps your tutor plan your sessions.

Grade 9·13 problems·~12 min·Common Core Math - HS Functions·group·hsf-if-a-3
Work through problems with immediate feedback
A

Procedures

1.

The sequence 3, 7, 11, 15, … has explicit formula a(n)=4n1a(n) = 4n - 1 and
recursive definition a(1)=3a(1) = 3, a(n)=a(n1)+4a(n) = a(n-1) + 4 for n2n \geq 2.

Use the recursive definition to compute a(4)a(4).