Define the sequence recursively using function notation.20,13,6,-1,-8...

Use the first 5 terms of each sequence to state if the sequence is arithmetic, geometric, or neither. C: 1, 2, 4, 8, 16, 32, . . .

Write the first three terms of each sequence. Determine whether each sequence is arithmetic geometric or neither. a(1)=7,a(n)=a(n-1)-3 for n≥2.

Use the first 5 terms of each sequence to state if the sequence is arithmetic, geometric, or neither.D: 1,1/2,1/4,1/8,1/16, . . .

Define the sequence recursively using function notation.30,40,50,60,70...

Use the first 5 terms of each sequence to state if the sequence is arithmetic, geometric, or neither. B: 80, 40, 20, 10, 5, 2.5, . . .

Define the sequence recursively using function notation. 2,3,5,9,17...

d(1)=1, d(n)=n x d(n-1) for n≥2. Write the first three terms of each sequence. Determine whether each sequence is arithmetic geometric or neither.

b(1)=2, b(n)=2 x b(n-1)-1 for n≥2. Write the first three terms of each sequence. Determine whether each sequence is arithmetic geometric or neither.

Define the sequence recursively using function notation. 3,9,27,81...

Use the first 5 terms of each sequence to state if the sequence is arithmetic, geometric, or neither. E: 20, 13, 6, -1, -8, . . .

Use the first 5 terms of each sequence to state if the sequence is arithmetic, geometric, or neither. A: 30, 40, 50, 60, 70, . . .