|
|
A185917
|
|
Weight array of max{n,k}, by antidiagonals.
|
|
3
|
|
|
1, 1, 1, 1, -1, 1, 1, 0, 0, 1, 1, 0, -1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, -1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, -1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, -1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1
|
|
COMMENTS
|
A member of the accumulation chain ... < A185917 < A051125 < A185958 < ..., where A051125, written as a rectangular array M, is given by M(n,k) = max{n,k}. See A144112 for definitions of weight array and accumulation array.
|
|
LINKS
|
|
|
FORMULA
|
T(n,k)= 1 if n=1 or k=1; T(n,n)= -1 for n>1; T(n,k)= 0 otherwise.
|
|
EXAMPLE
|
Northwest corner:
1, 1, 1, 1, 1, 1
1, -1, 0, 0, 0, 0
1, 0, -1, 0, 0, 0
1, 0, 0, -1, 0, 0
1, 0, 0, 0, -1, 0
|
|
MATHEMATICA
|
T[1, k_] := 1; T[n_, 1] := 1; T[n_, n_] := -1; T[n_, k_] := 0;
TableForm[Table[T[n, k], {n, 1, 5}, {k, 1, 5}]]
Table[T[n - k + 1, k], {n, 10}, {k, n, 1, -1}] (* G. C. Greubel, Jul 22 2017 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|