The recursive sequence can be identified because each term is given as a function of one or more of the previous terms. Being n an integer greater than 1, then:
f(n) = 2f(n-1)+1
f(1) = 4
To find the first four terms of the sequence, we set n to the values {2,3,4,5}