%I #21 Apr 23 2022 14:55:26

%S 0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,1,1,0,0,0,0,2,0,2,0,0,0,0,0,1,1,0,

%T 0,0,0,0,0,2,0,2,0,0,0,0,0,0,3,1,1,3,0,0,0,0,0,0,0,2,0,2,0,0,0,0,0,0,

%U 0,0,3,1,1,3,0,0,0,0,0,0,0,0,4,2,0,2,4,0,0,0,0

%N Array read by antidiagonals: A(i, j) = abs(i - j) if min(i, j) < max(i, j) <= 2*min(i, j), and otherwise 0, with i >= 0 and j >= 0.

%e The array begins:

%e 0, 0, 0, 0, 0, 0, 0, 0, ...

%e 0, 0, 1, 0, 0, 0, 0, 0, ...

%e 0, 1, 0, 1, 2, 0, 0, 0, ...

%e 0, 0, 1, 0, 1, 2, 3, 0, ...

%e 0, 0, 2, 1, 0, 1, 2, 3, ...

%e 0, 0, 0, 2, 1, 0, 1, 2, ...

%e 0, 0, 0, 3, 2, 1, 0, 1, ...

%e 0, 0, 0, 0, 3, 2, 1, 0, ...

%e ...

%t A[i_,j_]:=If[Min[i, j]<Max[i, j]<=2Min[i, j], Abs[j-i], 0]; Flatten[Table[A[i-j,j],{i,0,12},{j,0,i}]]

%Y Cf. A003983, A049581, A051125, A307018 (antidiagonal half-sums), A353452, A353453.

%K nonn,tabl

%O 0,24

%A _Stefano Spezia_, Apr 21 2022