seonatic/index.html

## index.html
<!DOCTYPE html>
<html>
<head>
  <meta charset="utf-8">
  <meta name="viewport" content="width=device-width">
  <title>JS Bin</title>
</head>
<body>

<script id="jsbin-javascript">
function listSquared (m, n) {
  var matches = [];

  for (var i = m; i <= n; ++i) {
    var sum = getDivisors(i).reduce((sum, n) => sum + n * n, 0);
    var ok = Number.isInteger(Math.sqrt(sum));

    if (ok) {
      matches.push([i, sum]);
    }
  }

  return matches;
}

function getDivisors (n) {
  var divisors = [];

  for (var i = 1; i <= n / 2; ++i) {
    if (n % i) { //n % i is the opposite of n % i ==0
      continue;
    }

    divisors.push(i);
  }

  return divisors.concat([n]);
}
</script>


<script id="jsbin-source-javascript" type="text/javascript">function listSquared (m, n) {
  var matches = [];

  for (var i = m; i <= n; ++i) {
    var sum = getDivisors(i).reduce((sum, n) => sum + n * n, 0);
    var ok = Number.isInteger(Math.sqrt(sum));

    if (ok) {
      matches.push([i, sum]);
    }
  }

  return matches;
}

function getDivisors (n) {
  var divisors = [];

  for (var i = 1; i <= n / 2; ++i) {
    if (n % i) { //n % i is the opposite of n % i ==0
      continue;
    }

    divisors.push(i);
  }

  return divisors.concat([n]);
}</script></body>
</html>

## jsbin.gokimad.js
function listSquared (m, n) {
  var matches = [];

  for (var i = m; i <= n; ++i) {
    var sum = getDivisors(i).reduce((sum, n) => sum + n * n, 0);
    var ok = Number.isInteger(Math.sqrt(sum));

    if (ok) {
      matches.push([i, sum]);
    }
  }

  return matches;
}

function getDivisors (n) {
  var divisors = [];

  for (var i = 1; i <= n / 2; ++i) {
    if (n % i) { //n % i is the opposite of n % i ==0
      continue;
    }

    divisors.push(i);
  }

  return divisors.concat([n]);
}
	<!DOCTYPE html>
	<html>
	<head>
	<meta charset="utf-8">
	<meta name="viewport" content="width=device-width">
	<title>JS Bin</title>
	</head>
	<body>

	<script id="jsbin-javascript">
	function listSquared (m, n) {
	var matches = [];

	for (var i = m; i <= n; ++i) {
	var sum = getDivisors(i).reduce((sum, n) => sum + n * n, 0);
	var ok = Number.isInteger(Math.sqrt(sum));

	if (ok) {
	matches.push([i, sum]);
	}
	}

	return matches;
	}

	function getDivisors (n) {
	var divisors = [];

	for (var i = 1; i <= n / 2; ++i) {
	if (n % i) { //n % i is the opposite of n % i ==0
	continue;
	}

	divisors.push(i);
	}

	return divisors.concat([n]);
	}
	</script>



	<script id="jsbin-source-javascript" type="text/javascript">function listSquared (m, n) {
	var matches = [];

	for (var i = m; i <= n; ++i) {
	var sum = getDivisors(i).reduce((sum, n) => sum + n * n, 0);
	var ok = Number.isInteger(Math.sqrt(sum));

	if (ok) {
	matches.push([i, sum]);
	}
	}

	return matches;
	}

	function getDivisors (n) {
	var divisors = [];

	for (var i = 1; i <= n / 2; ++i) {
	if (n % i) { //n % i is the opposite of n % i ==0
	continue;
	}

	divisors.push(i);
	}

	return divisors.concat([n]);
	}</script></body>
	</html>