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 Solvers39
Suggested Problems
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2049 Solvers
-
The Hitchhiker's Guide to MATLAB
3412 Solvers
-
793 Solvers
-
654 Solvers
-
676 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!