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 Solvers37
Suggested Problems
-
6439 Solvers
-
Sum of first n terms of a harmonic progression
499 Solvers
-
Who has power to do everything in this world?
485 Solvers
-
531 Solvers
-
374 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!