Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082578
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082578 A binomial sum. +0
2
1, 7, 67, 767, 9587, 126011, 1711595, 23796515, 336666215, 4828084575, 69994481871, 1023793569567, 15086216016367, 223704570996367, 3335098322412367, 49954148031128767, 751296616443141667 (list; graph; listen)
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

CROSSREFS

Partial sums of A000894.

Sequence in context: A036948 A020469 A038386 this_sequence A082698 A093170 A120079

Adjacent sequences: A082575 A082576 A082577 this_sequence A082579 A082580 A082581

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research