Fibonacci proved that if the sum of two consecutive integers is a square (that is, if n + (n - 1) = u^2 for some u), then the square of the larger integer will equal the sum of two nonzero squares. Verify this result and furnish several numerical examples.