;;AUTOLOAD: fib
;;AUTODOC: fib "fibonnacci function"
;;(fib n) 
;;
;;Calculates the sum of the first n numbers in the fibonacci suite
;;calculated the naive way by recursing: fib(n) = fib(n-1) + fib(n-2)
;;Useful for benchmarks

(defun fib (n)
  (if (< n 2) n
    (+ (fib (- n 1)) (fib (- n 2)))))
