Compute the n-th Fibonacci Number
f(0) = 0, f(1) = 1, f(2) = 1, f(3) = 2, ... f(42) = 267914296
This solution returns f(0) = 1, which contradicts the decription of the given problem.
This solution uses filter from the Signal Processing Toolbox.
Yes, it uses filter, but filter is indeed not a toolbox function, but a built-in function. You can fix the error by changing f=y(n-2) to f = y(n)
... and then change first input of filter to [1,-1] and remove +1 from the end of the line.
Return the 3n+1 sequence for n
5201 Solvers
193 Solvers
465 Solvers
Make one big string out of two smaller strings
1070 Solvers
Back to basics 17 - white space
209 Solvers