|
|
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.
|
|
3
|
|
|
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
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,24
|
|
LINKS
|
|
|
EXAMPLE
|
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, ...
...
|
|
MATHEMATICA
|
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}]]
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|