How can I make this algorithm more efficient for a puzzle?

Question

The puzzle is: given a number n, I need to return an array containing all numbers whose sum of their squares equals n2 in a increasing sequence. For ex