|
Search: id:A156319
|
|
|
| A156319 |
|
Triangle by columns: (1, 2, 0, 0, 0,...) in every column. |
|
+0 2
|
|
| 1, 2, 1, 0, 2, 1, 0, 0, 2, 1, 0, 0, 0, 2, 1, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Binomial transform of the triangle = A110813.
Eigensequence of the triangle = A001045
Inverse = a triangle with (1, -2, 4, -8, 16,...) in every column.
Triangle T(n,k), 0<=k<=n, given by [2,-2,0,0,0,0,0,0,...] DELTA [1,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938 . [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Feb 08 2009]
|
|
FORMULA
|
Triangle read by rows, T(n,k) = 1 if (n = k); 2 if k = n-1, 0 otherwise.
By columns, (1, 2, 0, 0, 0,...) in every column.
T(n,k)=A097806(n,k)*2^(n-k). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Feb 08 2009]
|
|
EXAMPLE
|
First few rows of the triangle =
1;
2, 1;
0, 2, 1;
0, 0, 2, 1;
0, 0, 0, 2, 1;
0, 0, 0, 0, 2, 1;
0, 0, 0, 0, 0, 2, 1;
0, 0, 0, 0, 0, 0, 2, 1;
0, 0, 0, 0, 0, 0, 0, 2, 1;
...
|
|
CROSSREFS
|
Cf. A110813, A001045
Sequence in context: A067613 A058531 A093073 this_sequence A083650 A030204 A138514
Adjacent sequences: A156316 A156317 A156318 this_sequence A156320 A156321 A156322
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Feb 07 2009
|
|
|
Search completed in 0.002 seconds
|