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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152059 a(n) = number of ways 2n-1 seats can be occupied by at most n people for n>=1, with a(0)=1. 0
1, 2, 13, 136, 1961, 36046, 805597, 21204548, 642451441, 22021483546, 842527453421, 35591363004352, 1645373927307673, 82625931422081126, 4478815087922020861, 260648364396903639676, 16208855884741850686817 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

a(n) = Sum_{k=0..n} k!*C(2*n-1,k)*C(n, k)).

Central terms of triangle A086885 (after initial term).

PROG

(PARI) a(n)=sum(k=0, n, k!*binomial(2*n-1, k)*binomial(n, k))

CROSSREFS

Cf. A086885.

Sequence in context: A065132 A047856 A187021 * A132063 A143137 A003414

Adjacent sequences:  A152056 A152057 A152058 * A152060 A152061 A152062

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Nov 22 2008

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 14 09:18 EST 2012. Contains 205614 sequences.