login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082578 A binomial sum. 2
1, 7, 67, 767, 9587, 126011, 1711595, 23796515, 336666215, 4828084575, 69994481871, 1023793569567, 15086216016367, 223704570996367, 3335098322412367, 49954148031128767, 751296616443141667 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

Formula: a(n) = Sum[ Binomial[ 2 k, k ] Binomial[ 2 k + 1, k ], { k, 0, n } ] 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

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: A020469 A199756 A038386 * A082698 A093170 A120079

Adjacent sequences:  A082575 A082576 A082577 * A082579 A082580 A082581

KEYWORD

easy,nonn

AUTHOR

Emanuele Munarini (munarini(AT)mate.polimi.it), May 07 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:27 EST 2012. Contains 205859 sequences.