Simple implementation of Sieve of Eratosthenes (eSieve) in JavaScript

eSieve.js

// https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
var eSieve = function(limit){
    
    var numbers = [];
    
    for(let i = 2; i <= limit; ++i){
        numbers.push({
            value : i
        });
    };
    //numbers[0].isPrime = true;

    for(i = 0; i<numbers.length; ++i){
        if(numbers[i].isPrime !== false){
            for(let j = i + numbers[i].value; j < numbers.length; j+= numbers[i].value){
                numbers[j].isPrime = false;
            }
        }
    }

    return numbers.filter(x=>x.isPrime !== false);
}