OFFSET
0,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
FORMULA
a(n) = [x^n] 1/((1-4*x) * (1-x)^(n+1)).
a(n) = Sum_{k=0..n} 4^k * (-3)^(n-k) * binomial(2*n+1,k) * binomial(2*n-k,n-k).
a(n) = Sum_{k=0..n} 4^k * binomial(2*n-k,n-k).
G.f.: 1/( sqrt(1-4*x) * (2*sqrt(1-4*x)-1) ).
a(n) ~ 2^(4*n+2) / 3^(n+1). - Vaclav Kotesovec, Aug 20 2025
D-finite with recurrence 3*n*a(n) +2*(-14*n+3)*a(n-1) +32*(2*n-1)*a(n-2)=0. - R. J. Mathar, Aug 21 2025
a(n) = binomial(1+2*n, n)*hypergeom([1, -n], [2+n], -3). - Stefano Spezia, Nov 05 2025
MATHEMATICA
Table[Sum[3^k * Binomial[2*n+1, n-k], {k, 0, n}], {n, 0, 30}] (* Vincenzo Librandi, Sep 03 2025 *)
a[n_]:=Binomial[1+2 n, n]*Hypergeometric2F1[1, -n, 2+n, -3]; Array[a, 24, 0] (* Stefano Spezia, Nov 05 2025 *)
PROG
(PARI) a(n) = sum(k=0, n, 3^k*binomial(2*n+1, n-k));
(Magma) [&+[3^k * Binomial(2*n+1, n-k): k in [0..n]]: n in [0..25]]; // Vincenzo Librandi, Sep 03 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Aug 11 2025
STATUS
approved
