I am a beginner to Clojure and I made a little script that prints out every prime number from 1 to 1000. Let me know if there are any improvements that I can make:

(loop [i 2]
  (loop [j 2]
    (if (= j i)
      (println i)())
    (if (= (mod i j) 0)()
      (recur (inc j))))
  (if (< i 1000)
    (recur (inc i))()))

I am a beginner to Clojure and I made a little script that prints out every prime number from 1 to 1000. Let me know if there are any improvements that I can make:

(loop [i 2]
  (loop [j 2]
    (when (= j i)
      (println i))
    (when-not (= (mod i j) 0)
          (recur (inc j))))
  (when (< i 1000)
    (recur (inc i))))