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 A352967 #21 Apr 23 2022 14:55:26
%S A352967 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 A352967 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 A352967 0,0,3,1,1,3,0,0,0,0,0,0,0,0,4,2,0,2,4,0,0,0,0
%N A352967 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 A352967 The array begins:
%e A352967 0, 0, 0, 0, 0, 0, 0, 0, ...
%e A352967 0, 0, 1, 0, 0, 0, 0, 0, ...
%e A352967 0, 1, 0, 1, 2, 0, 0, 0, ...
%e A352967 0, 0, 1, 0, 1, 2, 3, 0, ...
%e A352967 0, 0, 2, 1, 0, 1, 2, 3, ...
%e A352967 0, 0, 0, 2, 1, 0, 1, 2, ...
%e A352967 0, 0, 0, 3, 2, 1, 0, 1, ...
%e A352967 0, 0, 0, 0, 3, 2, 1, 0, ...
%e A352967 ...
%t A352967 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 A352967 Cf. A003983, A049581, A051125, A307018 (antidiagonal half-sums), A353452, A353453.
%K A352967 nonn,tabl
%O A352967 0,24
%A A352967 _Stefano Spezia_, Apr 21 2022