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”).

A115359
Matrix (1,x)-(x,x^2) in Riordan array notation.
10
1, -1, 1, 0, 0, 1, 0, -1, 0, 1, 0, 0, 0, 0, 1, 0, 0, -1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, -1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, -1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1
OFFSET
0,1
COMMENTS
Row sums are 1,0,1,0,1,0... Diagonal sums are A115360. Inverse is A115361.
FORMULA
Number triangle T(n, k)=if(n=k, 1, 0) OR if(n=2k+1, -1, 0).
EXAMPLE
Triangle begins:
1;
-1, 1;
0, 0, 1;
0, -1, 0, 1;
0, 0, 0, 0, 1;
0, 0, -1, 0, 0, 1;
0, 0, 0, 0, 0, 0, 1;
0, 0, 0, -1, 0, 0, 0, 1;
0, 0, 0, 0, 0, 0, 0, 0, 1;
0, 0, 0, 0, -1, 0, 0, 0, 0, 1;
...
PROG
(PARI) tabl(nn) = {T = matrix(nn, nn, n, k, n--; k--; if ((n==k), 1, if (n==2*k+1, -1, 0))); for (n=1, nn, for (k=1, n, print1(T[n, k], ", "); ); print(); ); } \\ Michel Marcus, Mar 28 2015
CROSSREFS
Sequence in context: A256538 A074910 A115356 * A117906 A090678 A110037
KEYWORD
easy,sign,tabl
AUTHOR
Paul Barry, Jan 21 2006
STATUS
approved