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
-
2372 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2921 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1407 Solvers
-
The sum of the numbers in the vector
649 Solvers
-
Find the max element of the array
2342 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!