OFFSET
1,1
COMMENTS
Appears to be n such that sigma(n)==0 (mod 4) and n is expressible as a sum of 2 squares. - Benoit Cloitre, Apr 20 2003
The comment that is in above is true most of the time. However if number of odd divisors of n that is a term of this sequence is not divisible by 4, then sigma(n) cannot be divisible by 4. For example; 325, 425, 625, 650, ... See also A000443 for more related examples. - Altug Alkan, Jun 09 2016
If m is a term then (a^2 + b^2) * m is a term for a,b > 0. Hence this sequence is closed under multiplication. - David A. Corneth, Jun 10 2016
LINKS
David A. Corneth, Table of n, a(n) for n = 1..10749
G. Xiao, Two squares
MATHEMATICA
lst={}; q=-1; k=1; Do[Do[x=a^2; Do[y=b^2; If[x+y==n, If[n==q&&k==1, AppendTo[lst, n]]; If[n!=q, q=n; k=1, k++ ]], {b, Floor[(n-x)^(1/2)], a+1, -1}], {a, Floor[n^(1/2)], 1, -1}], {n, 2*6!}]; lst (* Vladimir Joseph Stephan Orlovsky, Jan 22 2009 *)
PROG
(PARI) is(n) = {my(t=0, i); t=sum(i=1, sqrtint((n-1)\2), issquare(n-i^2)); t>1} \\ David A. Corneth, Jun 10 2016
(PARI) is(n)=if(n<9, return(0)); my(v=valuation(n, 2), f=factor(n>>v), t=1); for(i=1, #f[, 1], if(f[i, 1]%4==1, t*=f[i, 2]+1, if(f[i, 2]%2, return(0)))); if(t%2, t-(-1)^v, t)/2-issquare(n/2)>1 \\ Charles R Greathouse IV, Jun 10 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved