The solution is 2, 7, 52, 2707, .... To find each term in the sequence, you square the previous term and add 3. This sequence is represented by the recursive formula an = (an-1)2 + 3, where a1 = 2.
For example, if the function h(n) gives the number of person-hours it takes to assemble n engines in a factory, then the positive integers would be an appropriate domain for the function.
