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 Solvers38
Suggested Problems
-
254 Solvers
-
473 Solvers
-
Deleting an element in a matrix
491 Solvers
-
Electrical Diode Current Calculation
1137 Solvers
-
Convert from Fahrenheit to Celsius
27972 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!