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
-
Flip the main diagonal of a matrix
904 Solvers
-
Return the first and last characters of a character array
11819 Solvers
-
Duplicate each element of a vector.
635 Solvers
-
Sum of first n positive integers
622 Solvers
-
Area of an equilateral triangle
6783 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!