login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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.
Equals A115359 when the first row of the array is removed. - Georg Fischer, Jul 26 2023
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
Sequence in context: A166360 A204183 A204177 * A143104 A127236 A117947
KEYWORD
tabl,sign
AUTHOR
Clark Kimberling, Feb 07 2011
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 01:50 EDT 2024. Contains 371756 sequences. (Running on oeis4.)