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
-
Find the sum of all the numbers of the input vector
55177 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2061 Solvers
-
576 Solvers
-
Rotate a matrix for 180 degree
188 Solvers
-
461 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!