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
-
6978 Solvers
-
Back to basics 8 - Matrix Diagonals
967 Solvers
-
Getting the indices from a vector
11888 Solvers
-
439 Solvers
-
1127 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!