Composite Number Sequences Inspired by this question
Given a positive integer \$n\$, your code must output the first \$n\$ composite numbers.
Input / Output
You may write a program or a function. Input is through STDIN or function argument and output is to STDOUT, or function return value.
Output can be a List, Array, or String.
Examples
 0 -&gt; 
 1 -&gt; 4
 2 -&gt; 4, 6
 3 -&gt; 4, 6, 8
13 -&gt; 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22


Rules

As always standard loopholes are disallowed.

Built-ins that generate prime or composite numbers are not allowed.

Built-ins relating to prime or composite numbers are not allowed.
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