Composite Number Sequences
Pyth - 10 bytes
A valid answer. Uses Wilson's Theorem.
.f%h.!tZZQ

Try it online here.

Old answer
Pyth - 6 chars
Uses builtin for prime factorization, not prime checking.
.ftPZQ

Try it online here.
.f  Q         First n that passes filter of lambda Z, uses input for how many
 t            Tail. This makes all that have len-one prime factorization become empty list, and thus falsey.
  P           Prime factorization - primes have a len-one factorization.
   Z          Lambda var