incremental sieve of Eratosthenes Based on the python implementation https://gist.github.com/Jach/1761175

gistfile1.js

sieve = function (size) {
    var primes = [],
        i = 2,
        nonprimes = {};
    
    while (primes.length < size) {
        if (nonprimes[i] == undefined) {
            primes.push(i);
            nonprimes[i*i] = [i];
        } else {
            var primefactors = nonprimes[i];
            primefactors.forEach(function (prime) {
                if (nonprimes[i+prime] == undefined) {
                    nonprimes[i+prime] = [];
                }
                nonprimes[i+prime].push(prime);  
            });
            //save some memory and some search time
            delete nonprimes[i];
        }
        i=i+1;
    }
    return primes
}