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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082579 A binomial sum. 1
1, 1, 5, 31, 241, 2261, 24781, 309835, 4342241, 67308841, 1141960501, 21026890391, 417264626065, 8871853115581, 201100863674621, 4838817223845571, 123128720142540481, 3302478863343928145, 93091427773284348901 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

a(n) = n!*sum(k=1..n, binomial(n+k-1,2*k-1)/k!).

Recurrence: a(n+3) - (3*n+7)*a(n+2) + (n+2)*(3*n+2)*a(n+1) - (n+2)*(n+1)*n*a(n) = 0.

E.g.f.: exp( x/( 1 - x )^2 ).

Special values of the hypergeometric function 2F2 : a(n)=n!*n*hypergeom([n+1, -n+1], [3/2, 2], -1/4), n>=1. From Karol A. Penson - (penson(AT)lptl.jussieu.fr)- Jan 29 04.

PROG

(Maxima)

a(n):=n!*sum(binomial(n+k-1, 2*k-1)/k!, k, 1, n); [From Vladimir Kruchinin kru(AT)ie.tusur.ru, Apr 21 2011]

CROSSREFS

Sequence in context: A069321 A177797 A186859 * A024451 A046852 A056541

Adjacent sequences:  A082576 A082577 A082578 * A082580 A082581 A082582

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 05:45 EST 2012. Contains 205694 sequences.