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
-
3403 Solvers
-
Reverse the Words (not letters) of a String
472 Solvers
-
662 Solvers
-
128 Solvers
-
Change the first and last diagonal element of the identity matrix to zero
160 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!