3 added 26 characters in body
source | link

Haskell, 4745 bytes

-2 bytes thanks to BMO.

f n=[i|i<-[n+1..2*n-1]2*n],all((>0).mod i)[2..i-1]]

Try it online!Try it online!

Haskell, 47 bytes

f n=[i|i<-[n+1..2*n-1],all((>0).mod i)[2..i-1]]

Try it online!

Haskell, 45 bytes

-2 bytes thanks to BMO.

f n=[i|i<-[n+1..2*n],all((>0).mod i)[2..i-1]]

Try it online!

2 deleted 3 characters in body
source | link

Haskell, 4947 bytes

f n=[i|i<-[n+1..2*n-1],modall(product[1(>0).mod i)[2..i-1]^2)i>0]1]]

Try it online!Try it online!

Haskell, 49 bytes

f n=[i|i<-[n+1..2*n-1],mod(product[1..i-1]^2)i>0]

Try it online!

Haskell, 47 bytes

f n=[i|i<-[n+1..2*n-1],all((>0).mod i)[2..i-1]]

Try it online!

1
source | link

Haskell, 49 bytes

f n=[i|i<-[n+1..2*n-1],mod(product[1..i-1]^2)i>0]

Try it online!