cp's OEIS Frontend

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.

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.

Original entry on oeis.org

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, 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, 0, 0, 3, 1, 1, 3, 0, 0, 0, 0, 0, 0, 0, 0, 4, 2, 0, 2, 4, 0, 0, 0, 0
Offset: 0

Views

Author

Stefano Spezia, Apr 21 2022

Keywords

Examples

			The array begins:
    0, 0, 0, 0, 0, 0, 0, 0, ...
    0, 0, 1, 0, 0, 0, 0, 0, ...
    0, 1, 0, 1, 2, 0, 0, 0, ...
    0, 0, 1, 0, 1, 2, 3, 0, ...
    0, 0, 2, 1, 0, 1, 2, 3, ...
    0, 0, 0, 2, 1, 0, 1, 2, ...
    0, 0, 0, 3, 2, 1, 0, 1, ...
    0, 0, 0, 0, 3, 2, 1, 0, ...
    ...
		

Crossrefs

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

Programs

  • Mathematica
    A[i_,j_]:=If[Min[i, j]