Let G be a function defined for all nonnegative integers by the following recursive definition.
G(0) = 1, G(1) = 2
G(n + 2) = G(n)2 + G(n + 1), n ≥ 0
Compute the first five values of G.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.