Need help with this question

Asequence {an} is defined recursively, with a1 = 1, a2 = 2 and, for n > 2, an = an-1 an-2 . find the term a241

F(x) = x2 − 9, and g(x) = x − 3 f(x) = x2 − 4x + 3, and g(x) = x − 3 f(x) = x2 + 4x − 5, and g(x) = x − 1 f(x) = x2 − 16, and g(x) = x − 4 h(x) = x + 5 arrowright h(x) = x + 3 arrowright h(x) = x + 4 arrowright h(x) = x − 1 arrowright

Jack has a piece of red ribbon that is two times as long as his piece of blue ribbon. he says that he can use two different equation to find out how long his piece of red ribbon is compared to his piece of blue ribbon is. is he correct? explain his reasoning