SumSquareDivisors.py

def SumSquareDivisisors(m, n):
   from math import sqrt as sq
   result = []
   f = lambda x: x**2
   for k in range(m, n+1):
      L = [k]
      for i in range(1, k//2 + 1):
         if k % i == 0:
            L.append(i)
      M = list(map(f, L))
      totalSum = sum(M)
      if sq(totalSum) % 1:
         result.append([k, totalSum])
   return result

print(SumSquareDivisisors(1,250))