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 alphabetic word product
3475 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2070 Solvers
-
Accessing elements on the diagonal
107 Solvers
-
558 Solvers
-
Change the first and last diagonal element of the identity matrix to zero
161 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!