Prime number generator in clojure, port from F#

gistfile1.clj

(defn primes []
  "Generates an (infinite, lazy) sequence of primes"
  (let [reinsert (fn [table x prime]
    (let [key (+ prime x)]
      (assoc table key (conj (get table key) prime))))]
    (letfn [(primes-step [table d]
      (if-let [factors (get table d)]
        (let [newTable (dissoc table d)]
          (recur (reduce #(reinsert %1 d %2) newTable factors) (inc d)))
        (lazy-seq (cons d (primes-step (assoc table (* d d) (list d)) (inc d))))))]
      (primes-step {} 2))))