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
-
997 Solvers
-
2279 Solvers
-
797 Solvers
-
Set the array elements whose value is 13 to 0
1451 Solvers
-
Electrical Diode Current Calculation
1223 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!