Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Aug 17 2021 10:13:33
%S 1,3,8,6,16,31,10,26,50,80,15,39,75,120,179,21,54,103,164,244,332,28,
%T 72,137,218,324,441,585,36,92,175,278,413,562,745,948,45,115,218,346,
%U 514,699,926,1178,1463,55,140,265,420,623,846,1120,1424,1768,2136
%N Triangle read by rows: T(n,k) (1<=k<=n) = Sum_{i=1..n, j=1..k, gcd(i,j)=1} (n+1-i)*(k+1-j).
%C T(n,k) = (1/4) * number of ways to select 3 distinct points forming a triangle of unsigned area = 1/2 from a rectangle of grid points with side lengths n and k.
%C Permutations of the 3 points are not counted separately.
%H Seiichi Manyama, <a href="/A320541/b320541.txt">Rows n = 1..140, flattened</a>
%e The triangle begins:
%e 1
%e 3 8
%e 6 16 31
%e 10 26 50 80
%e 15 39 75 120 179
%e 21 54 103 164 244 332
%e 28 72 137 218 324 441 585
%e ...
%e a(1) = 1 because 4 triangles of area 1/2 in a [0 1]X[0 1] square can be formed by cutting the unit square into 2 triangles along the diagonals.
%p T := proc(m,n) local a,i,j; a:=0;
%p for i from 1 to m do for j from 1 to n do
%p if gcd(i,j)=1 then a:=a+(m+1-i)*(n+1-j); fi; od: od: a; end;
%p for m from 1 to 12 do lprint([seq(T(m,n),n=1..m)]); od: # _N. J. A. Sloane_, Feb 04 2020
%Y Cf. A000217, A115004 (main diagonal), A320539, A320543, A333292.
%Y This triangle is equivalent to the table in A114999.
%K nonn,tabl
%O 1,2
%A _Hugo Pfoertner_, Oct 15 2018
%E Replaced definition (now a comment) by explicit formula. - _N. J. A. Sloane_, Feb 04 2020