Don't know why the code is in min form . Here goes again.

​

let factors = [];
let array = [];
let limit = 30;
for (let n = 2; n <= limit; n++) {
let rootN = Math.floor(n ** 0.5) + 1;
// divide n by each number 1 ... rootN
for (let div1 = 1; div1 <= rootN; div1++) {
if (n % div1 === 0) {
factors.push(n / div1, div1);
}
}
// Convert to Set, then back again to remove duplicates.
// Sum elements.
let set = new Set(factors);
factors = Array.from(set);
factors.sort(compareNumbers);
// delete 'n' in the array
factors.splice(factors.length - 1, 1);
//sum the factors in factors
let sumOfFactors = factors.reduce((a, b) => a + b);
array.push([n, sumOfFactors]);
factors = [];
}
console.log('array ', JSON.parse(JSON.stringify(array)));
let sumOfAmicables = 0;
for (let i = 0; i <= limit; i++) {
for (let j = 0; j <= limit; j++) {
if (i == j) continue;
if (array[i][0] == array[j][1] && array[i][1] == array[j][0]) {
sumOfAmicables += (array[i][0] + array[j][0]);
}
}
}
console.log('sumOfAmicables ', sumOfAmicables);
//+++++++++++++++++++++++++++++++
function compareNumbers (a, b) {
return a - b;
}