OFFSET
0,2
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000(terms 1..100 from Vincenzo Librandi)
FORMULA
a(n) = Sum_{k=0..n} binomial(3*k,k).
Recurrence: 2*(n+2)*(2n+3)*a(n+2)-(31*n^2+95*n+72)*a(n+1)+3*(3*n+4)(3*n+5)*a(n)=0.
G.f.: 2*cos((1/3)*arcsin(3*sqrt(3*x)/2))/((1-x)*sqrt(4-27*x)).
a(n) ~ sqrt(3)*27^(n+1)/(46*4^n*sqrt(Pi*n)). - Vaclav Kotesovec, Oct 20 2012
MATHEMATICA
Table[Sum[Binomial[3k, k], {k, 0, n}], {n, 0, 20}]
Accumulate[Table[Binomial[3n, n], {n, 0, 20}]] (* Nearly 300 times faster than the program above. *) (* Harvey P. Dale, Sep 14 2024 *)
PROG
(Maxima) makelist(sum(binomial(3*k, k), k, 0, n), n, 0, 20);
(PARI) for(n=0, 25, print1(sum(k=0, n, binomial(3*k, k)), ", ")) \\ G. C. Greubel, Jan 27 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Emanuele Munarini, Apr 08 2011
STATUS
approved
