Okay -- thanks for letting us know this!
(As you did not explain what you already understand about sequences or this exercise, we
guessed at what information might help you begin.)
Let's try again!
For this attempt, I'm not going to use symbol n or any subscripts; I'll use a different set of symbols for the elements of the sequence. Hopefully, this will help.
Here is the sequence notation: {a, b, c, d, e, f, ...}
Clearly, symbol a represents the first element in the sequence, symbol b represents the second element, and so on.
Here is the pattern of your
recursive sequence:
a = 1
b = 2a + 2
c = 2b + 2
d = 2c + 2
e = 2d + 2
f = 2e + 2
and so on ...
Do you understand this recursive pattern, as I've presented it?
The FIRST element's value is given to you: a = 1
The value of every element AFTER the first one is found by doubling the
previous element, followed by adding 2.
Let's calculate the second element's value:
b = 2a + 2
We already know the value of a, so we replace symbol a with its value:
b = 2(1) + 2
Simplify:
b = 4
Now that we know the value of the second element, we can find the next element's value:
c = 2b + 2
Substitute 4 for b:
c = 2(4) + 2
Simplify:
c = 10
Is this enough information for you to confirm that the value of the fourth element is 22?
If not, please show your work OR ask a specific question.
Cheers! :cool:
PS: Once you understand the recursive pattern AND how to calculate element values, then we can go back to discussing the subscript notation.
NOTE: In my first reply, I typed an incorrect name. (I wrote "regressive" instead of "recursive".) Sorry about that mistake.