|
%I #7 Dec 06 2017 10:56:11
%S 0,0,0,0,1,0,1,1,1,1,1,2,2,2,1,1,2,3,3,2,1,1,3,3,4,3,3,1,2,3,4,5,5,4,
%T 3,2,2,4,5,6,6,6,5,4,2,2,4,6,7,7,7,7,6,4,2,2,5,6,8,8,9,8,8,6,5,2,3,5,
%U 7,9,10,10,10,10,9,7,5,3,3,6,8,10,11,12,12,12,11,10,8,6,3,3,6,9,11,12,13,14
%N Rectangular array by antidiagonals: label each unit square in the first quadrant lattice by its northeast vertex (x,y) and mark squares for which (x,y) is congruent mod 4 to one of the following: (1,4), (2,2), (3,3), (4,1); then R(m,n) is the number of marked squares in the rectangle [0,m]x[0,n].
%C Row 4n is given by n*(1,2,3,4,5,6,...).
%H G. C. Greubel, <a href="/A143996/b143996.txt">Table of n, a(n) for the first 50 rows, flattened</a>
%F R(m,n) = floor(m*n/4).
%t b[n_, m_] := Floor[m*n/4]; a:= Table[a[n, m], {n, 1, 25}, {m, 1, 25}]; Table[a[[k, n - k + 1]], {n, 1, 20}, {k, 1, n}] // Flatten (* _G. C. Greubel_, Dec 05 2017 *)
%Y Cf. A143997, A143998, A143999, A144000, A144001.
%K nonn,tabl
%O 1,12
%A _Clark Kimberling_, Sep 07 2008
|
