Match each sequence to its appropriate recursively defined function. f(1) = 13
f(n) = f(n-1) + 26 for n 2
f(1) = -24
f(n) = -4 f(n-1) for na 2
f(1) = -24
f(n) = 4 f(n-1) for n 2
f(1) = 28
f(n) = f(n-1) - 84 for n 2 2
f(1) = 28
f(n) = -4 f(n-1) for na 2
f(1) = 13
f(n) = 3 f(n-1) for n 2 2
Sequence
Recursively Defined Function
13, 39, 65, 91, ...
-24,-96, -384,-1,536,... 15
no
28, -112, 448,-1,792, ...