Sequences and Series precalc multiple choice, will give brainliest.
![Sequences and Series precalc multiple choice will give brainliest class=](https://us-static.z-dn.net/files/dc7/727c4a8dd120877e5c6ef54a151fb082.png)
9514 1404 393
Answer:
False
Step-by-step explanation:
The given formula is the "explicit" formula for the sequence.
The recursive formula would be ...
a[1] = 160
a[n] = 1/2·a[n-1] . . . . each term expressed in as a function of previous terms
The given statement is false.