%I A106594
%S A106594 1,0,1,1,0,1,1,0,1,1,0,0,1,0,1,2,0,1,0,0,2,1,0,1,1,0,1,1,0,0,1,0,0,1,0,
%T A106594 2,1,0,1,0,0,1,1,0,1,2,0,1,1,0,2,0,0,0,2,0,1,1,0,1,0,0,0,1,0,2,1,0,1,1,
%U A106594 0,1,1,0,0,2,0,1,1,0,2,0,0,1,0,0,1,1,0,0,2,0,1,2,0,0,1,0,1
%N A106594 a(n) = number of primitive solutions to 4n+1 = x^2 + y^2.
%C A106594 "Primitive" means that x and y are positive and mutually prime.
%e A106594 E.g. a(16)=2 because 65 = 8^2+1^2 = 7^2+4^2. a(11)=0 because although 
               45=6^2+3^2, 6 and 3 are not mutually prime. a(2)=0 because although 
               9=3^2+0^2, 0 is not positive.
%Y A106594 Cf. A106602.
%Y A106594 Sequence in context: A025895 A104451 A106602 this_sequence A143251 A115235 
               A160973
%Y A106594 Adjacent sequences: A106591 A106592 A106593 this_sequence A106595 A106596 
               A106597
%K A106594 easy,nonn
%O A106594 1,16
%A A106594 Colin Mallows (colinm(AT)avaya.com), May 10 2005