OFFSET
0,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
FORMULA
a(n) = [x^n] (1+x)^(4*n-3)/(1-x).
a(n) = [x^n] 1/((1-x)^(3*n-3) * (1-2*x)).
a(n) = Sum_{k=0..n} 2^k * (-1)^(n-k) * binomial(4*n-3,k) * binomial(4*n-k-4,n-k).
a(n) = Sum_{k=0..n} 2^k * binomial(4*n-k-4,n-k).
G.f.: 1/(g^2 * (2-g) * (4-3*g)) where g = 1+x*g^4 is the g.f. of A002293.
D-finite with recurrence: 128*(4*n-7)*(2*n-5)*(4*n-9)*(22*n^3-50*n^2+5*n+30)*a(n-2) -8*(1892*n^6-16004*n^5+51038*n^4-73470*n^3+39874*n^2+6165*n-9450)*a(n-1) +3*n*(3*n-4)*(3*n-5)*(22*n^3-116*n^2+171*n-47)*a(n) = 0. - Georg Fischer, Aug 17 2025
a(n) ~ 2^(8*n - 13/2) / (sqrt(Pi*n) * 3^(3*n - 7/2)). - Vaclav Kotesovec, Oct 19 2025
a(n) = Sum_{k=0..floor(n/2)} binomial(4*n-2,n-2*k). - Seiichi Manyama, Nov 11 2025
MATHEMATICA
Table[Sum[Binomial[4*n-3, k], {k, 0, n}], {n, 0, 30}] (* Vincenzo Librandi, Sep 03 2025 *)
PROG
(PARI) a(n) = sum(k=0, n, binomial(4*n-3, k));
(Magma) [&+[Binomial(4*n-3, k): k in [0..n]]: n in [0..25]]; // Vincenzo Librandi, Sep 03 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Aug 13 2025
STATUS
approved
