The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152297 Alternate binomial partial sums of binomial(2n,n)*binomial(3n,n) (A006480). 2
1, 5, 79, 1427, 28447, 599435, 13100065, 293737085, 6713171455, 155700711995, 3653740285729, 86561367835805, 2067026079739921, 49689509437820933, 1201321507453119103, 29187308928225658787, 712192597620218620735 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = sum((-1)^(n-k)*binomial(n,k)*binomial(2*k,k)*binomial(3*k,k),k=0..n).
D-finite with recurrence Recurrence: (n+3)^2*a(n+3)-(24*n^2+120*n+149)*a(n+2)-51*(n+2)^2*a(n+1)-26*(n+1)*(n+2)*a(n)=0.
E.g.f.: exp(-x)*F(1/3,2/3;1,1;27*x), where F(a1,a2;b1;z) is a hypergeometric series.
a(n) ~ 13*sqrt(3) * 26^n / (27*Pi*n). - Vaclav Kotesovec, Mar 02 2014
MATHEMATICA
Table[Sum[Binomial[n, k]Binomial[2k, k]Binomial[3k, k](-1)^(n-k), {k, 0, n}], {n, 0, 16}]
PROG
(Maxima) makelist(sum((-1)^(n-k)*binomial(n, k)*binomial(2*k, k)*binomial(3*k, k), k, 0, n), n, 0, 16);
CROSSREFS
Sequence in context: A197747 A198152 A197232 * A366640 A244585 A293786
KEYWORD
nonn,easy
AUTHOR
Emanuele Munarini, Apr 14 2011
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 16:26 EDT 2024. Contains 372554 sequences. (Running on oeis4.)