login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102587 Triangular matrix, read by rows, equal to the matrix inverse of triangle A094531, which is the right-hand side of trinomial table A027907. 7
1, -1, 1, -1, -2, 1, 2, 0, -3, 1, -1, 4, 2, -4, 1, -1, -5, 5, 5, -5, 1, 2, 0, -12, 4, 9, -6, 1, -1, 7, 7, -21, 0, 14, -7, 1, -1, -8, 12, 24, -30, -8, 20, -8, 1, 2, 0, -27, 9, 54, -36, -21, 27, -9, 1, -1, 10, 15, -60, -15, 98, -35, -40, 35, -10, 1, -1, -11, 22, 66, -99, -77, 154, -22, -66, 44, -11, 1, 2, 0, -48, 16, 180, -120, -196, 216, 9 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,5

COMMENTS

Riordan array ((1-x^2)/(1+x+x^2),x/(1+x+x^2)). - Paul Barry (pbarry(AT)wit.ie), Jul 14 2005

Inverse of A094531. Rows sums are 1,0,-2,0,2,0,-2,... with g.f. (1-x^2)/(1+x^2). Diagonal sums are (-1)^n*C(1,n) with g.f. 1-x. - Paul Barry (pbarry(AT)wit.ie), Jul 14 2005

Row sums form the period 4 sequence: {1, 0,-2,0,2, 0,-2,0,2, ...}. Absolute row sums form A102588.

Sum_{k=0..n} T(n,k)^2 = 2*A002426(n) for n>0.

EXAMPLE

Rows begin:

[1],

[ -1,1],

[ -1,-2,1],

[2,0,-3,1],

[ -1,4,2,-4,1],

[ -1,-5,5,5,-5,1],

[2,0,-12,4,9,-6,1],

[ -1,7,7,-21,0,14,-7,1],

[ -1,-8,12,24,-30,-8,20,-8,1],

[2,0,-27,9,54,-36,-21,27,-9,1],

[ -1,10,15,-60,-15,98,-35,-40,35,-10,1],

[ -1,-11,22,66,-99,-77,154,-22,-66,44,-11,1],...

PROG

(PARI) {T(n, k)=local(A); A=matrix(n+1, n+1, r, c, if(r<c-1, 0, polcoeff((1+x+x^2)^(r-1), r+c-2))); return((A^-1)[n+1, k+1])}

CROSSREFS

Cf. A094531, A102588.

Sequence in context: A071485 A127969 A081733 * A159834 A177995 A147786

Adjacent sequences:  A102584 A102585 A102586 * A102588 A102589 A102590

KEYWORD

sign,tabl

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jan 22 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 16:40 EST 2012. Contains 205635 sequences.