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
-
Return the largest number that is adjacent to a zero
5527 Solvers
-
2188 Solvers
-
Find the peak 3n+1 sequence value
2571 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1293 Solvers
-
2221 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!