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
-
Read a column of numbers and interpolate missing data
2355 Solvers
-
567 Solvers
-
757 Solvers
-
610 Solvers
-
Find my daddy long leg (No 's')
2832 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!