(defn fib [n]
  "Find the nth Fibonacci numbers."
  (case n
    0 0
    1 1
    2 1
    (+ (fib (- n 1)) (fib (- n 2)))))

(
 (fn [k]
   (loop [start_seq '(1 1)
          y 3]
     (let [x (cons (fib y) start_seq)]
       (if (= k y)
         (reverse x)
         (recur x (inc y)))))) 4)

Generated by matt using scpaste at Fri Oct 28 12:32:11 2011. HADT. (original)