Recognize sequences, including recursive sequences, as functions whose domains are subsets of integers.
Find a sequence term from an explicit rule, table, or recursive rule
Problem
Use this sequence representation to find \(a(5)\): \(a_n~=~3n~+~2\) for \(n~\ge~1\).
Big Picture
What this problem is really about
The requested sequence subscript is the function input, so first confirm that term number belongs to the stated integer domain. Then substitute it for n in the explicit rule and follow the operation order. Reading the result as the term’s output keeps the coefficient from being confused with the requested index.
Inside Gozunta
Turn the preview into practice.
More than a preview
Gozunta lets you study this problem—and more than 10,000 others.
Create targeted learning sessions, use hints, check your answer, read the walkthrough, watch the video, print the work, and track your progress.
