OFFSET
0,4
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
FORMULA
G.f.: 1/sqrt((1-x)^2 - 4*x^3/(1-x)).
D-finite with recurrence (5 + 5*n)*a(n) + (-17 - 8*n)*a(n + 1) + (15 + 6*n)*a(n + 2) + (-13 - 4*n)*a(n + 3) + (n + 4)*a(n + 4) = 0. - Robert Israel, Feb 09 2026
a(n) ~ 5^(n + 1/2) / (2^(1/3) * sqrt(3*Pi*(21*2^(2/3) - 12*2^(1/3) - 11)*n) * (2^(4/3) - 2^(2/3) + 1)^(n-1)). - Vaclav Kotesovec, Feb 10 2026
MAPLE
f:= gfun:-rectoproc({(5 + 5*n)*a(n) + (-17 - 8*n)*a(n + 1) + (15 + 6*n)*a(n + 2) + (-13 - 4*n)*a(n + 3) + (n + 4)*a(n + 4), a(0) = 1, a(1) = 1, a(2) = 1, a(3) = 3}, a(n), remember):
map(f, [$0..100]); # Robert Israel, Feb 09 2026
MATHEMATICA
Table[Sum[Binomial[2*k, k]*Binomial[n, 3*k], {k, 0, Floor[n/3]}], {n, 0, 31}] (* Vincenzo Librandi, Feb 07 2026 *)
PROG
(PARI) a(n) = sum(k=0, n\3, binomial(2*k, k)*binomial(n, 3*k));
(Magma) [&+[Binomial(2*k, k)* Binomial(n, 3*k) : k in [0..Floor(n/3)]] : n in [0..35] ]; // Vincenzo Librandi, Feb 07 2026
(Python)
from math import comb
def A393244(n): return sum(comb(2*k, k) * comb(n, 3*k) for k in range(n // 3 + 1)) # Aitzaz Imtiaz, Feb 09 2026
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Feb 07 2026
STATUS
approved
