%I A055096
%S A055096 5,10,13,17,20,25,26,29,34,41,37,40,45,52,61,50,53,58,65,74,85,65,68,
%T A055096 73,80,89,100,113,82,85,90,97,106,117,130,145,101,104,109,116,125,136,
%U A055096 149,164,181,122,125,130,137,146,157,170,185,202,221,145,148,153,160
%N A055096 Triangle of sums of 2 distinct nonzero squares: (1^2+2^2), (1^2+3^2), 
               (2^2+3^2), (1^2+4^2), (2^2+4^2), (3^2+4^2), ...
%C A055096 Discovered by Bernard Frenicle de Bessy (1605?-1675). - Paul Curtz (bpcrtz(AT)free.fr), 
               Aug 18 2008
%D A055096 (Bernard) de? Frenicle (de Bessy), studying Pythagorean triangles: Methode 
               pour trouver ...; in Divers ouvrages de mathematique et de physique 
               par Messieurs de l'Academie Royale des Sciences, In-folio, (4)+6+519 
               pages, Paris, 1693. - Paul Curtz (bpcrtz(AT)free.fr), Aug 18 2008
%H A055096 A. Karttunen, <a href="http://www.iki.fi/~kartturi/matikka/A055096e.htm">
               Larger table, showing also locations of 4k+1 primes and squares</
               a>
%H A055096 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               CongruumProblem.html">Link to a section of The World of Mathematics.</
               a>
%H A055096 <a href="Sindx_Su.html#ssq">Index entries for sequences related to sums 
               of squares</a>
%F A055096 a(n) = sum2distinct_squares_array(n)
%p A055096 sum2distinct_squares_array := (n) -> (((n-((trinv(n-1)*(trinv(n-1)-1))/
               2))^2)+((trinv(n-1)+1)^2));
%Y A055096 Sorting gives A024507. Count of divisors: A055097, Moebius: A055132. 
               For trinv, follow A055088. Left edge: A002522. Right edge: A001844. 
               Central column: A033429.
%Y A055096 Sequence in context: A024507 A004431 A025302 this_sequence A132777 A134961 
               A053029
%Y A055096 Adjacent sequences: A055093 A055094 A055095 this_sequence A055097 A055098 
               A055099
%K A055096 nonn,tabl
%O A055096 1,1
%A A055096 Antti Karttunen Apr 04 2000