このツイートに基づいて書いてみました。https://twitter.com/2_wykipedia/status/1402160697497165826

nepleague.js

var primes = [];
var cond = [1];
for(var i = 2; i < 335; i++){
    var flag = true;
    var primeFlag = true;
    for(var j = 0; j < primes.length; j++){
	var prime = primes[j];
	if(prime*prime > i)break;
	primeFlag = primeFlag && (i%prime !== 0)
	// flag === true if not divisible by any prime
	flag = flag && (i%(prime*prime) !== 0);
    }
    if(primeFlag)primes.push(i);
    //factors
    var factors = [];
    for(var j = 1; j <= Math.sqrt(i); j++){
	if(i%j === 0){
	    //console.log(j);
	    factors.push(j);
	    factors.push(i/j);
	}
    }
    //console.log(i,factors,factors.reduce((a,b)=>a+b),2*i);
    if(flag && factors.reduce((a,b)=>a+b) < 2*i)cond.push(i);
}
console.log(primes);
console.log(cond);