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
-
All your base are belong to us
575 Solvers
-
Determine the number of odd integers in a vector
824 Solvers
-
113 Solvers
-
Double all elements in the array
2229 Solvers
-
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!