js: returns a list of n primes

primes.js

function primes(n) {
	function iter(i, acc) {
		if(acc.length > n) return acc;
		else if(i > 1 && divisor(2)) {
			acc.push(i);
			return iter(i + 1, acc);
		}
		else return iter(i + 1, acc);
		function divisor(x) {
			if(x > Math.sqrt(i)) return true;
			else if(i % x === 0) return false;
			else return divisor(x + 1);
		}
	}
	return iter(1, []);
}