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
-
Sum all integers from 1 to 2^n
18094 Solvers
-
Back to basics 11 - Max Integer
812 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
896 Solvers
-
How long do each of the stages of the rocket take to burn?
564 Solvers
-
Find Out sum of principal diagonal element of given matrix
259 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!