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 Solvers39
Suggested Problems
-
3847 Solvers
-
The Answer to Life, the Universe, and Everything
582 Solvers
-
Fahrenheit to Celsius converter
606 Solvers
-
find the maximum element of the matrix
539 Solvers
-
762 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!