(define (numbers n)
  (define (createList start end xs)
    (cond ((= start end) (cons end xs))
          (else (cons start (createList (+ start 1) end xs)))))
  (define (isPrime num start)
    (cond ((= num start) #t)
          ((= (modulo num start) 0) #f)
          (else (isPrime num (+ start 1)))))
  (define (countDeviders num start)
    (cond ((= start num) (if (isPrime num 2) 1 0))
          (else (if (and (= (modulo num start) 0) (isPrime start 2))
                    (+ 1 (countDeviders num (+ 1 start)))
                    (countDeviders num (+ 1 start))))))
  (define (helper k)
    (filter (lambda (x) (< (countDeviders x 2) k)) (createList 2 n '())))
  helper)