Find the first N combinations of n and m where the sum of the digits of n^m equal n

code.js

const { range, sum } = require('lodash')

// find the first N combinations of n and m where the sum of the digits of n^m equal n

const run = (count) => {
  let results = []

  const digits = n => [...String(n)].map(Number)

  for (const n of range(2, 300)) {
    for (const m of range(2, 40)) {
      const power = Math.pow(n, m)

      const powerDigits = digits(power)

      const powerDigitAddition = sum(powerDigits)

      if (n === powerDigitAddition) {
        const r = { x:n, y:m, power }
        console.log(`${n}, ${m}`)
        results.push(r)

        if (results.length === count) {
          return results
        }
      }
    }
  }
}

const output = run(50)

console.log(output)