OFFSET
0,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Robert Israel, Recurrence of order 8
FORMULA
a(n) = Sum_{k=0..n} (k+1) * (2*k+1) * binomial(4*n-2*k+1,n-k)/(4*n-2*k+1).
D-finite with recurrence of order 8 (see link). - Robert Israel, Jul 23 2026
MAPLE
with(gfun):
e1:= -g+1+x*g^4:
e2:= z*(1-x*g^2)^2-g:
eq:= factor(resultant(e1, e2, g)):
de:= algeqtodiffeq(eq/x^3, z(x)):
rec:= diffeqtorec(de, z(x), a(n)):
f:= rectoproc(rec, a(n), remember):
map(f, [$0..30]); # Robert Israel, Jul 23 2026
MATHEMATICA
Table[Sum[(k+1)*(2*k+1)*Binomial[4*n-2*k+1, n-k]/(4*n-2*k+1), {k, 0, n}], {n, 0, 25}] (* Vincenzo Librandi, Dec 03 2025 *)
PROG
(PARI) a(n) = sum(k=0, n, (k+1)*(2*k+1)*binomial(4*n-2*k+1, n-k)/(4*n-2*k+1));
(Magma) [&+[(k+1)*(2*k+1)*Binomial(4*n-2*k+1, n-k)/(4*n-2*k+1): k in [0..n]] : n in [0..30] ]; // Vincenzo Librandi, Dec 03 2025
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
Seiichi Manyama, Dec 02 2025
STATUS
approved
