|
Search: id:A123191
|
|
|
| A123191 |
|
Triangle read by rows: T(n,k) is the coefficient of x^k in the polynomial P[n] defined by P[0]=1, P[1]=x-1, P[n]=(1-x)P[n-1]+xP[n-2] for n>=2. Alternatively, P[n]=-1-(-x)^n-3*Sum((-x)^k,k=1..n-1). |
|
+0
2
|
|
| 1, -1, 1, -1, 3, -1, -1, 3, -3, 1, -1, 3, -3, 3, -1, -1, 3, -3, 3, -3, 1, -1, 3, -3, 3, -3, 3, -1, -1, 3, -3, 3, -3, 3, -3, 1, -1, 3, -3, 3, -3, 3, -3, 3, -1, -1, 3, -3, 3, -3, 3, -3, 3, -3, 1, -1, 3, -3, 3, -3, 3, -3, 3, -3, 3, -1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
FORMULA
|
T(0,0)=1; T(n,n)=(-1)^(n+1) for n>=1; T(n,0)=-1 for n>=1; T(n,k)=(-1)^(k+1)*3 for n>=2, 1<=k<=n-1. G.f.=G(t,x)=(1+2tx-2x)/[(1-x)(1+tx)].
|
|
EXAMPLE
|
Triangle starts:
1;
-1,1;
-1,3,-1;
-1,3,-3,1;
-1,3,-3,3,-1;
-1,3,-3,3,-3,1;
|
|
MAPLE
|
T:=proc(n, k): if n=0 and k=0 then 1 elif k=n then (-1)^(n+1) elif k=0 then -1 else (-1)^(k+1)*3 fi end: for n from 0 to 12 do seq(T(n, k), k=0..n) od; # yields sequence in triangular form
|
|
MATHEMATICA
|
p[0, x] = 1; p[1, x] = x - 1; p[k_, x_] := p[k, x] = (1 - x)*p[k - 1, x] + x*p[k - 2, x]; w = Table[CoefficientList[p[n, x], x], {n, 0, 10}]; Flatten[w]
|
|
CROSSREFS
|
Sequence in context: A099545 A132429 A046540 this_sequence A157454 A106255 A143086
Adjacent sequences: A123188 A123189 A123190 this_sequence A123192 A123193 A123194
|
|
KEYWORD
|
sign,tabl
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), Oct 03 2006
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com), Oct 29 2006
|
|
|
Search completed in 0.002 seconds
|
