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 Solvers36
Suggested Problems
-
Back to basics 9 - Indexed References
462 Solvers
-
938 Solvers
-
968 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
884 Solvers
-
Check that number is whole number
5204 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!