login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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.
Equals A115359 when the first row of the array is removed. - Georg Fischer, Jul 26 2023
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
tabl,sign
AUTHOR
Clark Kimberling, Feb 07 2011
STATUS
approved