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
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15782 Solvers
-
502 Solvers
-
179 Solvers
-
Find my daddy long leg (No 's')
2726 Solvers
-
3425 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!