This document defines a recursive algorithm to find the nth term of a sequence where a0 = 1, a1 = 2, and an is the product of the previous two terms for n >= 2. The proposed solution is a recursive function that returns 1 if n = 0, 2 if n = 1, and otherwise returns the product of calling the function on n-1 and n-2, utilizing tail recursion that could be converted to a loop.

1. Define a recursive algorithm to find the nth term of the sequence defined by a0 = 1 , a1 = 2, and
an = an-1 x an-2 for n = 2,3,4...
Solution
I suppose we could use some pseudocode: int sequence (int n) { if (n == 0) return 1
if (n == 1) return 2; return sequence (n-1) * sequence (n-2); } Note that this uses "tail"
recursion in the last line, so it's easily convertible to a loop for your other question.