найти и напечатать в порядке убывания все простые числа из диапазона от 2 до 201

(defun is-prime (n &optional (k 3))
  (cond ((= n 2) t)
        ((evenp n) nil)
        ((> k (sqr n)) t)
        ((zerop (% n k)) nil)
        (t (is-prime n (+ k 2))))) 
 
 
(defun task (n &optional (r nil))
  (cond ((< n 2) r)
        ((is-prime n) (task (- n 1) (cons n r)))
        (t (task (- n 1) r))))
  
==> task
 
(task 201)
 
==> (2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199)

(defun task (n &optional (k 2) (r nil))
  (cond ((> k n) r)
        ((is-prime k) (task n (+ k 1) (cons k r)))
        (t (task n (+ k 1) r))))
  
==> task
 
(task 201)
 
==> (199 197 193 191 181 179 173 167 163 157 151 149 139 137 131 127 113 109 107 103 101 97 89 83 79 73 71 67 61 59 53 47 43 41 37 31 29 23 19 17 13 11 7 5 3 2)

(defun primep (n)
  (loop for i from 2 to (isqrt n) never (zerop (rem n i))))
 
(defun reversed-primes (n m)
  (loop for a downfrom m to n when (primep a) collect a))
 
> (reversed-primes 2 201)
(199 197 193 191 181 179 173 167 163 157 151 149 139 137 131 127 113 109 107
 103 101 97 89 83 79 73 71 67 61 59 53 47 43 41 37 31 29 23 19 17 13 11 7 5 3
 2)

;; racket-lang.org
(define prime-closure
  (let ((primes '(2))
        (current-prime 3))
    (lambda ()
      (unless (ormap (lambda (x) (= (remainder current-prime x) 0)) primes)
        (set! primes (cons current-prime primes)))
      (set! current-prime (+ 2 current-prime))
      primes)))
 
 
(define (foo n)
  (let ((primes (prime-closure)))
    (if (> (first primes) n)
        (rtest primes)
        (foo))))

;; racket-lang.org
(define prime-closure
  (let ((primes '(2))
        (current-prime 3))
    (lambda (#:reset (reset #f))
      (when reset
        (set! primes '(2))
        (set! current-prime 3))
      (unless (ormap (lambda (x) (= (remainder current-prime x) 0)) primes)
        (set! primes (cons current-prime primes)))
      (set! current-prime (+ 2 current-prime))
      primes)))
 
 
(define (foo n #:reset (reset #f))
  (let ((primes (prime-closure #:reset reset)))
    (if (> (first primes) n)
        (rest primes)
        (foo n))))
 
 
(define main
  (case-lambda
    (() (foo 21 #:reset #t))
    ((n) (foo n #:reset #t))
    (n n)))
 
(main)
(main 30)
;'(19 17 13 11 7 5 3 2)
;'(29 23 19 17 13 11 7 5 3 2)