OFFSET
0,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..600
FORMULA
a(n) = Sum_{k=0..n} 4^(n-k) * (k+1) * binomial(n-k/2-1,n-k).
D-finite with recurrence (-n+1)*a(n) +2*(4*n-7)*a(n-1) +(-15*n+41)*a(n-2) +2*(-2*n+3)*a(n-3)=0. - R. J. Mathar, Apr 02 2025
MATHEMATICA
Table[Sum[4^(n-k)* (k+1)* Binomial[n-k/2-1, n-k], {k, 0, n}], {n, 0, 25}] (* Vincenzo Librandi, May 13 2025 *)
PROG
(PARI) a(n) = sum(k=0, n, 4^(n-k)*(k+1)*binomial(n-k/2-1, n-k));
(Magma) R<x>:=PowerSeriesRing(Rationals(), 25); Coefficients(R!( 1/(1 - x/(1 - 4*x)^(1/2))^2)); // Vincenzo Librandi, May 13 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Mar 31 2025
STATUS
approved
