%I A024363
%S A024363 0,0,1,1,2,0,1,1,1,0,1,2,2,0,2,1,2,0,1,2,2,0,1,2,2,0,1,2,2,0,1,1,2,
%T A024363 0,2,2,2,0,2,2,2,0,1,2,2,0,1,2,1,0,2,2,2,0,2,2,2,0,1,4,2,0,2,1,4,0,
%U A024363 1,2,2,0,1,2,2,0,2,2,2,0,1,2,1,0,1,4,4,0,2,2,2,0,2,2,2,0,2,2,2,0,2
%N A024363 Number of primitive Pythagorean triangles with side n.
%C A024363 Consider primitive Pythagorean triangles (A^2 + B^2 = C^2, (A, B) = 1, 
               A <= B); sequence gives number of times AUBUC takes value n.
%H A024363 Ron Knott, <a href="http://www.mcs.surrey.ac.uk/Personal/R.Knott/Pythag/
               pythag.html">Pythagorean Triples and Online Calculators</a>
%F A024363 a(n)=0 for n=1 and n=2 (mod 4)=A016825. a(n)=A024361(n)+A024362(n). - 
               Lekraj Beedassy (blekraj(AT)yahoo.com), Dec 01 2003
%Y A024363 Cf. A024361, A024362.
%Y A024363 Sequence in context: A074272 A105553 A117165 this_sequence A050600 A129691 
               A117454
%Y A024363 Adjacent sequences: A024360 A024361 A024362 this_sequence A024364 A024365 
               A024366
%K A024363 nonn
%O A024363 1,5
%A A024363 David W. Wilson (davidwwilson(AT)comcast.net)