The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #10 May 10 2016 09:12:46
%S 0,0,0,0,4,0,0,10,10,0,0,16,28,16,0,0,22,50,50,22,0,0,28,74,96,74,28,
%T 0,0,34,98,150,150,98,34,0,0,40,122,208,244,208,122,40,0,0,46,146,268,
%U 350,350,268,146,46,0,0,52,170,328,464,516,464,328,170,52,0
%N Array read by antidiagonals: T(n,k) = number of ways to choose 3 distinct points from an n X k rectangular grid so that they form a right isosceles triangle of nonzero area.
%C A271910(n) = A272624(n) + A272625(n) + a(n).
%H Chai Wah Wu, <a href="/A272626/b272626.txt">Table of n, a(n) for n = 1..3003</a>
%H Chai Wah Wu, <a href="http://arxiv.org/abs/1605.00180">Counting the number of isosceles triangles in rectangular regular grids</a>, arXiv:1605.00180 [math.CO], 2016.
%F T(n,k) = 2*T(n,k-1)-T(n,k-2) for k > max(5,(n-1)^2).
%Y Cf. A271910, A272624, A272625.
%K nonn,tabl
%O 1,5
%A _Chai Wah Wu_, May 07 2016