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
-
17448 Solvers
-
Replace multiples of 5 with NaN
470 Solvers
-
Sum of odd numbers in a matrix
620 Solvers
-
Max Change in Consecutive Elements
181 Solvers
-
Find the Oldest Person in a Room
21039 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!