Let us call a positive integer k a square-pivot, if there is a pair of integers m 0 and n k, such that the sum of the (m+1) consecutive squares up to k equals the sum of the m consecutive squares from (n+1) on:
Some small square-pivots are
Find the sum of all distinct square-pivots 10^{10}.
These problems are part of Project Euler and are licensed under CC BY-NC-SA 2.0 UK