OpenStudy (anonymous):

The table below shows the values of f(n) for different values of n: n 1 2 3 4 5 6 f(n) 1 2 4 16 128 4096 Which recursive function best represents the values shown in the table? f(1) = 1, f(2) = 2, f(n) = f(n -3) + f(n - 2); n > 2 f(1) = 1, f(2) = 2, f(n) = f(n -3) f(n - 2); n > 2 f(1) = 1, f(2) = 2, f(n) = 2f(n -1) + f(n - 2); n > 2 f(1) = 1, f(2) = 2, f(n) = 2f(n -1) f(n - 2); n > 2

3 years ago
OpenStudy (anonymous):

@across @happyair

3 years ago
OpenStudy (anonymous):

Is this some type of sick joke?

3 years ago
OpenStudy (anonymous):

nooo...

3 years ago
OpenStudy (anonymous):

@Sunshine447 @mondona @KelliRovesSkittles @timaashorty

3 years ago