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
-
28023 Solvers
-
573 Solvers
-
Longest run of consecutive numbers
6608 Solvers
-
Who has power to do everything in this world?
487 Solvers
-
Find out total non zero element of matrix
287 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!