We need two things to write the recursive formula
- The first term,
![a](https://img.qammunity.org/2023/formulas/mathematics/college/l4smpmj8gwgq6o6tftm1k1t24qv5k7k6yf.png)
- The common difference,
![d](https://img.qammunity.org/2023/formulas/mathematics/college/l6aga5o9eed5s1h92z671su7bephchfiu2.png)
is the first value of this sequence. For this set of values,
, since
appears first.
, the common difference, is
. Basically it's just the the higher term minus the previous terms. To solve for
,
So regardless of what terms you choose, the common difference will be the same. Now the general formula for a recursive function is
where
is the
term. Let's substitute for
and
in this formula.
![t_(n) = 1 + (n - 1) * -3\\t_(n) = 1 + -3(n - 1)\\t_(n) = 1 - 3(n - 1)](https://img.qammunity.org/2023/formulas/mathematics/high-school/efn4yglamlhm8r9a7u1b5fe4m5er8h51uf.png)
So the recursive formula is
![t_(n) = 1 - 3(n -1)](https://img.qammunity.org/2023/formulas/mathematics/high-school/b8iqeppigseoh0mq2lg3ji6gdbed9wqhox.png)