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!)
A082578 a(n) = Sum_{k=0..n} binomial(2*k, k) * binomial(2*k+1,k). 3
1, 7, 67, 767, 9587, 126011, 1711595, 23796515, 336666215, 4828084575, 69994481871, 1023793569567, 15086216016367, 223704570996367, 3335098322412367, 49954148031128767, 751296616443141667 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Old name was "A binomial sum".
LINKS
FORMULA
Recurrence: (n+3)*(n+2)*a(n+2) - (17*n^2+69*n+66)*a(n+1) + (16*n^2+64*n+60)*a(n) = 0.
a(n) ~ 2^(4*n+5)/(15*Pi*n). - Vaclav Kotesovec, Oct 14 2012
MATHEMATICA
Table[Sum[Binomial[2k, k]*Binomial[2k+1, k], {k, 0, n}], {n, 0, 20}] (* Vaclav Kotesovec, Oct 14 2012 *)
PROG
(Maxima) makelist(sum(binomial(2*k, k)*binomial(2*k+1, k), k, 0, n), n, 0, 12);
CROSSREFS
Partial sums of A000894.
Sequence in context: A371398 A243675 A364924 * A291814 A253386 A082698
KEYWORD
easy,nonn
AUTHOR
Emanuele Munarini, May 07 2003
EXTENSIONS
Name changed by Wesley Ivan Hurt, Apr 18 2023
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 April 23 12:27 EDT 2024. Contains 371912 sequences. (Running on oeis4.)