Find the first 4 terms of the sequence given by the recursive definition: a_n= 2a_n-1_-1, a_1 = 3. the underscores indicate subs of the numbers.​

add an image

step-by-step explanation:

40 x 50 = 2000

step-by-step explanation:

the number of possible outcomes that do not show a 1 on the first spinner and show the number 4 on the second spinner is 2.

spinner 1 spinner 2

1                     1

1                     2

1                     3

1                     4

2                   1

2                   2

2                   3

2                   4   = not 1, and 4

3                   1

3                   2

3                   3

3                   4 = not 1, and 4

only 2 outcomes have passed the given condition.

step-by-step explanation: