|
Search: id:A110509
|
|
|
| A110509 |
|
Riordan array (1,x(1-2x)). |
|
+0
6
|
|
| 1, 0, 1, 0, -2, 1, 0, 0, -4, 1, 0, 0, 4, -6, 1, 0, 0, 0, 12, -8, 1, 0, 0, 0, -8, 24, -10, 1, 0, 0, 0, 0, -32, 40, -12, 1, 0, 0, 0, 0, 16, -80, 60, -14, 1, 0, 0, 0, 0, 0, 80, -160, 84, -16, 1, 0, 0, 0, 0, 0, -32, 240, -280, 112, -18, 1, 0, 0, 0, 0, 0, 0, -192, 560, -448, 144, -20, 1, 0, 0, 0, 0, 0, 0, 64, -672, 1120, -672, 180, -22, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
Inverse is Riordan array (1,xc(2x)) [A110510]. Row sums are A107920(n+1). Diagonal sums are (-1)^n*A052947(n).
|
|
FORMULA
|
Number triangle T(n, k)=(-2)^(n-k)*binomial(k, n-k)
T(n,k)=A109466(n,k)*2^(n-k). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 26 2008]
|
|
EXAMPLE
|
Rows begin
1;
0,1;
0,-2,1;
0,0,-4,1;
0,0,4,-6,1;
0,0,0,12,-8,1;
0,0,0,-8,24,-10,1;
|
|
CROSSREFS
|
Sequence in context: A071920 A065719 A113953 this_sequence A089975 A034366 A121465
Adjacent sequences: A110506 A110507 A110508 this_sequence A110510 A110511 A110512
|
|
KEYWORD
|
easy,sign,tabl
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Jul 24 2005
|
|
|
Search completed in 0.002 seconds
|
