OFFSET
0,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
FORMULA
a(n) = [x^n] (1-2*x)^n/(1-3*x)^(n+3).
a(n) = Sum_{k=0..n} 3^k * (-2)^(n-k) * binomial(n,k) * binomial(n+k+2,k).
a(n) = Sum_{k=0..n} 2^(n-k) * binomial(n,k) * binomial(n+k+2,n).
G.f.: 1/(sqrt(1-8*x+4*x^2) * ((1-2*x + sqrt(1-8*x+4*x^2))/2)^2).
a(n) ~ 3^(-1/4) * 2^(n + 1/2) * (2 + sqrt(3))^(n + 3/2) / sqrt(Pi*n). - Vaclav Kotesovec, Sep 16 2025
D-finite with recurrence (n+2)*a(n) +2*(-7*n-6)*a(n-1) +28*(2*n-1)*a(n-2) +8*(-7*n+13)*a(n-3) +16*(n-3)*a(n-4)=0. - R. J. Mathar, Sep 16 2025
a(n) = [x^n] (1+x)^(n+2) * (3+x)^n. - Seiichi Manyama, Sep 21 2025
MATHEMATICA
Table[Sum[ 3^k*Binomial[n, k]*Binomial[n+2, k], {k, 0, n}], {n, 0, 30}] (* Vincenzo Librandi, Sep 21 2025 *)
PROG
(PARI) a(n) = sum(k=0, n, 3^k*binomial(n, k)*binomial(n+2, k));
(Magma) [&+[3^k*Binomial(n, k)*Binomial(n+2, k): k in [0..n]]: n in [0..20]]; // Vincenzo Librandi, Sep 21 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Sep 15 2025
STATUS
approved
