A recursive sequence is a sequence of numbers whose values are determined by the numbers that come before them in the sequence.
We’re given a sequence whose (n + 1)-th term f(n + 1) depends on the value of the n-th term f(n), specified by the recursive rule
f(n + 1) = -4 f(n) + 3
We’re also given the 1st term in the sequence, f(1) = 1. Using this value and the recursive rule, we can find the next term f(2). (Just replace n with 1.)