|
Search: id:A124927
|
|
|
| A124927 |
|
Triangle read by rows: T(n,0)=1, T(n,k)=2*binom(n,k) if k>0 (0<=k<=n). |
|
+0
5
|
|
| 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; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Pascal triangle with all entries doubled except for the first entry in each row. Row sums are 2^(n+1)-1.
|
|
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: A087738 A133113 A124840 this_sequence A126279 A135837 A027144
Adjacent sequences: A124924 A124925 A124926 this_sequence A124928 A124929 A124930
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 12 2006
|
|
EXTENSIONS
|
Edited by njas, Nov 24 2006
|
|
|
Search completed in 0.002 seconds
|
