Number of factors of (n!)^2

factors.clj

(defn val-p-fact [n p]
  (letfn [(prime-powers [n p i]
            (lazy-seq
             (when (<= (Math/pow p i) n)
               (cons (Math/floor (/ n (Math/pow p i)))
                     (prime-powers n p (inc i))))))]
    (reduce + (prime-powers n p 1))))

(defn interview-street-equations [n]
  (int (reduce #(mod (* %1 %2) 1000007)
               1
               (map #(inc (* 2 (val-p-fact n %)))
                    (take-while #(<= % n) (lazy-primes))))))