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”).

A370103
a(n) = Sum_{k=0..n} (-1)^k * binomial(2*n+k-1,k) * binomial(4*n-k-1,n-k).
3
1, 1, 7, 28, 151, 751, 3976, 20924, 112023, 602182, 3260257, 17724928, 96766072, 529977917, 2910984412, 16027963528, 88440034711, 488918693466, 2707393587802, 15014647096172, 83380131228401, 463593653171495, 2580426581343200, 14377474236172320
OFFSET
0,3
FORMULA
a(n) = [x^n] 1/( (1+x)^2 * (1-x)^3 )^n.
The g.f. exp( Sum_{k>=1} a(k) * x^k/k ) has integer coefficients and equals (1/x) * Series_Reversion( x*(1+x)^2*(1-x)^3 ). See A365854.
a(n) = Sum_{k=0..floor(n/2)} binomial(3*n+k-1,k) * binomial(n,n-2*k).
a(n) = Sum_{k=0..floor(n/2)} binomial(2*n+k-1,k) * binomial(2*n-2*k-1,n-2*k).
PROG
(PARI) a(n) = sum(k=0, n, (-1)^k*binomial(2*n+k-1, k)*binomial(4*n-k-1, n-k));
(PARI) a(n, s=2, t=3, u=1) = sum(k=0, n\s, binomial(t*n+k-1, k)*binomial(u*n, n-s*k));
(PARI) a(n, s=2, t=2, u=1) = sum(k=0, n\s, binomial(t*n+k-1, k)*binomial((u+1)*n-s*k-1, n-s*k));
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Feb 10 2024
STATUS
approved