Clojure - Lazy vs non lazy sequence of primes

primes.clj

(defn prime?
  [x]
  (not-any? (fn [factor] (zero? (mod x factor)))
            (range 2 (dec x))))


(defn eager-primes
  ([n] (eager-primes n 2 []))
  ([n curr xs]
   (if (= n (count xs))
     xs
     (if (prime? curr)
       (recur n (inc curr) (conj xs curr))
       (recur n (inc curr) xs)))))


(defn primes
  ([]
   (primes 1))
  ([curr]
   (if (prime? (inc curr))
     (lazy-seq (cons (inc curr) (primes (inc curr))))
     (lazy-seq (primes (inc curr))))))

;; quel.core>
;; (eager-primes 10)
;; [2 3 5 7 11 13 17 19 23 29]
;; quel.core>
;; (take 10 (primes))
;; (2 3 5 7 11 13 17 19 23 29)
;; quel.core>