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
-
Project Euler: Problem 10, Sum of Primes
2120 Solvers
-
Find the index of n in magic(n)
273 Solvers
-
Matlab Basics - Switching Assignments
507 Solvers
-
2521 Solvers
-
676 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!