id:A152059 - OEIS Search Results

Search: id:A152059

Displaying 1-1 of 1 results found.

page 1

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

1, 2, 13, 136, 1961, 36046, 805597, 21204548, 642451441, 22021483546, 842527453421, 35591363004352, 1645373927307673, 82625931422081126, 4478815087922020861, 260648364396903639676, 16208855884741850686817 (list; graph; listen)

	OFFSET	`0,2`
	FORMULA	`a(n) = Sum_{k=0..n} k!C(2n-1,k)*C(n, k)).` `Central terms of triangle A086885 (after initial term).`
	PROGRAM	`(PARI) a(n)=sum(k=0, n, k!binomial(2n-1, k)*binomial(n, k))`
	CROSSREFS	`Cf. A086885.` `Sequence in context: A079165 A065132 A047856 this_sequence A132063 A143137 A003414` `Adjacent sequences: A152056 A152057 A152058 this_sequence A152060 A152061 A152062`
	KEYWORD	`nonn`
	AUTHOR	`Paul D. Hanna (pauldhanna(AT)juno.com), Nov 22 2008`

page 1

Search completed in 0.002 seconds

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.

AT&T Labs Research