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
-
3997 Solvers
-
16380 Solvers
-
Project Euler: Problem 3, Largest prime factor
1788 Solvers
-
Back to basics 12 - Input Arguments
621 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
647 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!