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 Solvers37
Suggested Problems
-
Return a list sorted by number of occurrences
2890 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2835 Solvers
-
Calculate the area of a triangle between three points
3424 Solvers
-
Volume of a sphere given its surface area
155 Solvers
-
1046 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!