|
Search: id:A103328
|
|
|
| A103328 |
|
Triangle T(n, k) read by rows: binomial(2n, 2k+1). |
|
+0
4
|
|
| 0, 2, 0, 4, 4, 0, 6, 20, 6, 0, 8, 56, 56, 8, 0, 10, 120, 252, 120, 10, 0, 12, 220, 792, 792, 220, 12, 0, 14, 364, 2002, 3432, 2002, 364, 14, 0, 16, 560, 4368, 11440, 11440, 4368, 560, 16, 0, 18, 816, 8568, 31824, 48620, 31824, 8568, 816, 18, 0, 20, 1140, 15504
(list; table; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A subset of Pascal's triangle A007318 with only even elements.
|
|
REFERENCES
|
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, id. 224.
|
|
EXAMPLE
|
0
2,0
4,4,0
6,20,6,0
8,56,56,8,0
10,120,252,120,10,0
12,220,792,792,220,12,0
14,364,2002,3432,2002,364,14,0
16,560,4368,11440,11440,4368,560,16,0
|
|
CROSSREFS
|
Cf. A091042, A086645, A103327.
Sequence in context: A093443 A099092 A081236 this_sequence A167312 A114122 A004174
Adjacent sequences: A103325 A103326 A103327 this_sequence A103329 A103330 A103331
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Ralf Stephan, Feb 06 2005
|
|
|
Search completed in 0.002 seconds
|
