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 Solvers40
Suggested Problems
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1330 Solvers
-
842 Solvers
-
1167 Solvers
-
1106 Solvers
-
Solve a System of Linear Equations
14937 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!