OFFSET
0,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
FORMULA
a(n) = [x^n] (1+x)^(3*n-1)/(1-x).
a(n) = [x^n] 1/((1-x)^(2*n-1) * (1-2*x)).
a(n) = Sum_{k=0..n} 2^k * (-1)^(n-k) * binomial(3*n-1,k) * binomial(3*n-k-2,n-k).
a(n) = Sum_{k=0..n} 2^k * binomial(3*n-k-2,n-k).
G.f.: 1/((2-g) * (3-2*g)) where g = 1+x*g^3 is the g.f. of A001764.
D-finite with recurrence: 24*(5*n+6)*(3*n-4)*(3*n-5)*a(n-2)-(295*n^3-451*n^2-234*n+360)*a(n-1)+2*n*(5*n+1)*(2*n-3)*a(n) = 0. - Georg Fischer, Aug 17 2025
a(n) ~ 3^(3*n - 1/2) / (sqrt(Pi*n) * 2^(2*n-1)). - Vaclav Kotesovec, Aug 27 2025
a(n) = Sum_{k=0..floor(n/2)} binomial(3*n,n-2*k). - Seiichi Manyama, Nov 11 2025
MATHEMATICA
Table[Sum[Binomial[3*n-1, k], {k, 0, n}], {n, 0, 25}] (* Vincenzo Librandi, Aug 27 2025 *)
PROG
(PARI) a(n) = sum(k=0, n, binomial(3*n-1, k));
(Magma) [&+[Binomial(3*n-1, k): k in [0..n]]: n in [0..25]]; // Vincenzo Librandi, Aug 27 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Aug 13 2025
STATUS
approved
