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
-
536 Solvers
-
552 Solvers
-
644 Solvers
-
232 Solvers
-
Rotate a matrix for 180 degree
188 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!