login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A138767
Triangle read by rows: T(n,k) = binomial(n,k)*binomial(2*n-2*k,n-1), n>=1, 0<=k<=floor(n/2+1/2).
0
1, 1, 4, 4, 15, 18, 3, 56, 80, 24, 210, 350, 150, 10, 792, 1512, 840, 120, 3003, 6468, 4410, 980, 35, 11440, 27456, 22176, 6720, 560, 43758, 115830, 108108, 41580, 5670, 126, 167960, 486200, 514800, 240240, 46200, 2520
OFFSET
1,3
COMMENTS
Row n contains floor(n/2+3/2) terms.
Row sums with alternate signs are 0.
LINKS
D. Beckwith, A Vanishing Alternating Sum: Problem 11212/11220, Amer. Math. Monthly 115, (2008), p. 366.
EXAMPLE
Triangle starts:
1,1;
4,4;
15,18,3;
56,18,3;
210,350,150,10;
MAPLE
T:=proc(n, r) options operator, arrow: binomial(n, r)*binomial(2*n-2*r, n-1) end proc: for n to 10 do seq(T(n, k), k=0..floor((1/2)*n+1/2)) end do; # yields sequence in triangular form
CROSSREFS
Sequence in context: A271546 A325655 A117187 * A048282 A068592 A198313
KEYWORD
nonn,tabf
AUTHOR
Emeric Deutsch, Mar 30 2008
STATUS
approved