1 2 3 4 5 6 7 8 9 10 11
-- very inefficient fibonacci function function fib(n) if n<2 then return n else return fib(n-1)+fib(n-2) end end print(fib(20))