%I A024359
%S A024359 0,0,1,0,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,2,1,0,1,1,1,0,1,2,1,0,1,1,2,
%T A024359 0,1,2,1,0,2,1,1,0,1,2,1,0,1,2,1,0,2,2,1,0,1,1,2,0,1,3,1,0,1,1,2,0,
%U A024359 1,2,2,0,1,1,1,0,2,2,1,0,1,1,1,0,1,3,2,0,2,2,1,0,1,2,2,0,2,2,1,0,1
%N A024359 Consider primitive Pythagorean triangles (A^2 + B^2 = C^2, (A, B) = 1, 
               A <= B); sequence gives number of times A takes value n.
%H A024359 Ron Knott, <a href="http://www.mcs.surrey.ac.uk/Personal/R.Knott/Pythag/
               pythag.html">Pythagorean Triples and Online Calculators</a>
%Y A024359 Sequence in context: A131038 A016353 A016398 this_sequence A088705 A065712 
               A153172
%Y A024359 Adjacent sequences: A024356 A024357 A024358 this_sequence A024360 A024361 
               A024362
%K A024359 nonn
%O A024359 1,20
%A A024359 David W. Wilson (davidwwilson(AT)comcast.net)