|
|
A183190
|
|
Triangle T(n,k), read by rows, given by (1, 1, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 1, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.
|
|
2
|
|
|
1, 1, 0, 2, 1, 0, 4, 4, 1, 0, 8, 12, 6, 1, 0, 16, 32, 24, 8, 1, 0, 32, 80, 80, 40, 10, 1, 0, 64, 192, 240, 160, 60, 12, 1, 0, 128, 448, 672, 560, 280, 84, 14, 1, 0, 256, 1024, 1792, 1792, 1120, 448, 112, 16, 1, 0, 512, 2304, 4608, 5376, 4032, 2016, 672, 144, 18, 1, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
If a new main diagonal of 0's is added to the triangle, then for this variant the following propositions hold:
The antidiagonal sums are A000129 (Pell numbers).
The signed row sums are 0 followed by 1's, autosequence companion to A054977.
(End)
|
|
LINKS
|
|
|
FORMULA
|
T(n,k) = 2*T(n-1,k) + T(n-1,k-1) with T(0,0)=T(1,0)=1 and T(1,1)=0 .
G.f.: (1-(1+y)*x)/(1-(2+y)*x).
|
|
EXAMPLE
|
Triangle begins:
1;
1, 0;
2, 1, 0;
4, 4, 1, 0;
8, 12, 6, 1, 0;
16, 32, 24, 8, 1, 0;
32, 80, 80, 40, 10, 1, 0;
...
|
|
MAPLE
|
T:= proc(n, k) option remember; `if`(k<0 or k>n, 0,
`if`(n<2, 1-k, 2*T(n-1, k) +T(n-1, k-1)))
end:
|
|
MATHEMATICA
|
T[n_, k_] /; 0 <= k <= n := T[n, k] = 2 T[n-1, k] + T[n-1, k-1];
T[0, 0] = T[1, 0] = 1; T[1, 1] = 0; T[_, _] = 0;
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|