|
| |
|
|
A124927
|
|
Triangle read by rows: T(n,0)=1, T(n,k)=2*binom(n,k) if k>0 (0<=k<=n).
|
|
4
| |
|
|
1, 1, 2, 1, 4, 2, 1, 6, 6, 2, 1, 8, 12, 8, 2, 1, 10, 20, 20, 10, 2, 1, 12, 30, 40, 30, 12, 2, 1, 14, 42, 70, 70, 42, 14, 2, 1, 16, 56, 112, 140, 112, 56, 16, 2, 1, 18, 72, 168, 252, 252, 168, 72, 18, 2, 1, 20, 90, 240, 420, 504, 420, 240, 90, 20, 2, 1, 22, 110, 330, 660, 924, 924
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Pascal triangle with all entries doubled except for the first entry in each row. Row sums are 2^(n+1)-1.
Contribution from Paul Barry (pbarry(AT)wit.ie), Sep 19 2008: (Start)
Reversal of A129994. Diagonal sums are A001595. T(2n,n) is A100320.
Binomial transform of matrix with 1,2,2,2,... on main diagonal, zero elsewhere. (End)
|
|
|
EXAMPLE
| Triangle starts:
1;
1,2;
1,4,2;
1,6,6,2;
1,8,12,8,2;
1,10,20,20,10,2;
|
|
|
MAPLE
| T:=proc(n, k) if k=0 then 1 else 2*binomial(n, k) fi end: for n from 0 to 12 do seq(T(n, k), k=0..n) od; # yields sequence in triangular form
|
|
|
CROSSREFS
| Cf. A000225.
Sequence in context: A133113 A124840 A145118 * A126279 A135837 A027144
Adjacent sequences: A124924 A124925 A124926 * A124928 A124929 A124930
|
|
|
KEYWORD
| nonn,tabl
|
|
|
AUTHOR
| Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 12 2006
|
|
|
EXTENSIONS
| Edited by N. J. A. Sloane (njas(AT)research.att.com), Nov 24 2006
|
| |
|
|
