Is there a formula that says if a number is the sum of 2 distinct nonzero squares ?
This is the sequence I'm trying to emulate: 5, 10, 13, 17, etc..
http://oeis.org/A004431 (Invalid it contains 85, etc..)
Need to make a program out of it, thanks in advance
I'm new here, sorry if the tags are somewhat lacking
EDIT: So this wasnt still the sequence I wanted. It must be the Numbers that are the sum of 2 distinct nonzero squares in exactly 1 way. So my previous question didn't specify the exactly 1 way part.
http://oeis.org/A025302 (This is the one!)