Square array A(n, k), n, k >= 0, read and filled by upwards antidiagonals the greedy way with distinct nonnegative integers such that the binary expansions of any two distinct terms in the same row or column or antidiagonal have no common 1's.

A366031

Square array A(n, k), n, k >= 0, read and filled by upwards antidiagonals the greedy way with distinct nonnegative integers such that the binary expansions of any two distinct terms in the same row or column or antidiagonal have no common 1's.