Write a recursive formula for the sequence of numbers.

Step-by-step explanation:

an = a1 + 4×[2^(n -1) - 1]

9514 1404 393

  a[1] = 3

  a[n] = 2×a[n-1] +1

Step-by-step explanation:

We observe the first differences are ...

  7-3 = 4

  15-7 = 8

  31-15 = 16

  63-31 = 32

The first differences increase by a factor of 2, so we expect the recursive formula will have a term that looks like "2×a[n-1]".

The second term is 2·3+1 = 7.

The third term is 2·7+1 = 15.

This suggests our recursive formula is ...

  a[1] = 3

  a[n] = 2×a[n-1] +1

1. is 4 and 2. is 3

step-by-step explanation:

so if you look at the first one you see that 1 is to 4 and 2 is to 8 and so on, so you can see for every 1 there is a times 4 so if it were 3 then it would be 3*4 and it is 12

for number 2 it is 3 because 1 is to 3 and 2 is to 6 so for every 1 there is 3 so if it were 3 then there would be 3*3 = 9

idek

step-by-step explanation: