|
Search: id:A166282
|
|
|
| A166282 |
|
Matrix inverse of Sierpinski's triangle (A047999, Pascal's triangle mod 2). |
|
+0
1
|
|
| 1, -1, 1, -1, 0, 1, 1, -1, -1, 1, -1, 0, 0, 0, 1, 1, -1, 0, 0, -1, 1, 1, 0, -1, 0, -1, 0, 1, -1, 1, 1, -1, 1, -1, -1, 1, -1, 0, 0, 0, 0, 0, 0, 0, 1, 1, -1, 0, 0, 0, 0, 0, 0, -1, 1, 1, 0, -1, 0, 0, 0, 0, 0, -1, 0, 1, -1, 1, 1, -1, 0, 0, 0, 0, 1, -1, -1, 1, 1, 0, 0, 0, -1, 0, 0, 0, -1, 0, 0, 0, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
EXAMPLE
|
Triangle begins:
. 1,
.-1, 1,
.-1, 0, 1,
. 1,-1,-1, 1,
.-1, 0, 0, 0, 1,
. 1,-1, 0, 0,-1, 1,
. 1, 0,-1, 0,-1, 0, 1,
.-1, 1, 1,-1, 1,-1,-1, 1,
.-1, 0, 0, 0, 0, 0, 0, 0, 1,
. 1,-1, 0, 0, 0, 0, 0, 0,-1, 1,
. 1, 0,-1, 0, 0, 0, 0, 0,-1, 0, 1,
.-1, 1, 1,-1, 0, 0, 0, 0, 1,-1,-1, 1,
. 1, 0, 0, 0,-1, 0, 0, 0,-1, 0, 0, 0, 1,
. ...
|
|
PROGRAM
|
(PARI) p=2; s=13; P=matpascal(s); PM=matrix(s+1, s+1, n, k, P[n, k]%p); IPM = 1/PM;
for(n=1, s, for(k=1, n, print1(IPM[n, k], ", ")); print())
|
|
CROSSREFS
|
A007318
Sequence in context: A078556 A144093 A143200 this_sequence A047999 A054431 A164381
Adjacent sequences: A166279 A166280 A166281 this_sequence A166283 A166284 A166285
|
|
KEYWORD
|
easy,sign,tabl
|
|
AUTHOR
|
Gerald McGarvey (gerald.mcgarvey(AT)comcast.net), Oct 10 2009
|
|
|
Search completed in 0.002 seconds
|
