This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A189979 #11 Mar 28 2014 23:35:22
%S A189979 0,1,4,9,17,26,39,53,71,91,114,136,169,197,231,267,310,346,397,437,
%T A189979 492,548,606,654,729,791,858,928,1007,1071,1173,1241,1333,1423,1509,
%U A189979 1600,1728,1814,1912,2015,2144
%N A189979 Number of right triangles, distinct up to congruence, on an n X n grid (or geoboard).
%e A189979 For n=3 the four right triangles are:
%e A189979 **. *.* *.* .*.
%e A189979 *.. *.. ... *..
%e A189979 ... ... *.. .*.
%p A189979 Triangles:=proc(n) local TriangleSet,i,j,k,l,A,B,C; TriangleSet:={}: for i from 0 to n do for j from 0 to n do for k from 0 to n do for l from 0 to n do A:=i^2+j^2: B:=k^2+l^2: C:=(i-k)^2+(j-l)^2: if A^2+B^2+C^2<>2*(A*B+B*C+C*A) then TriangleSet:={op(TriangleSet),sort([sqrt(A),sqrt(B),sqrt(C)])}: fi: od: od: od: od: return(TriangleSet); end:
%p A189979 IsRectangularTriangle:=proc(T) if T[1]^2+T[2]^2=T[3]^2 or T[1]^2+T[3]^2=T[2]^2 or T[2]^2+T[3]^2=T[1]^2 then true else false fi: end:
%p A189979 a:=proc(n) local TriangleSet,RectangularTriangleSet,i; TriangleSet:=Triangles(n): RectangularTriangleSet:={}: for i from 1 to nops(TriangleSet) do if IsRectangularTriangle(TriangleSet[i]) then RectangularTriangleSet:={op(RectangularTriangleSet),TriangleSet[i]} fi: od: return(nops(RectangularTriangleSet)); end:
%Y A189979 Cf. A028419, A077435.
%K A189979 nonn,more
%O A189979 1,3
%A A189979 _Martin Renner_, May 03 2011
%E A189979 a(21) through a(40) from _Martin Renner_, May 08 2011