Solve the recursion: f(n)=f(n-1)+1 + f(n-2)+2.
f(1)=4;
f(2)=8;
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers40
Suggested Problems
-
6998 Solvers
-
Which values occur exactly three times?
5253 Solvers
-
3450 Solvers
-
How long do each of the stages of the rocket take to burn?
563 Solvers
-
1055 Solvers
More from this Author14
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!