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
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
53337 Solvers
-
924 Solvers
-
Project Euler: Problem 3, Largest prime factor
1810 Solvers
-
Back to basics 11 - Max Integer
811 Solvers
-
2633 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!