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
-
10797 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1403 Solvers
-
Try 1.5.4: Celsius to Fahrenheit
873 Solvers
-
Find the dimensions of a matrix
567 Solvers
-
6296 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!