id:A082680 - OEIS Search Results

Search: id:A082680

Displaying 1-1 of 1 results found.

page 1

Triangle read by rows: 2-stack sortable n-permutations with k runs.

+0
1

1, 1, 1, 1, 4, 1, 1, 10, 10, 1, 1, 20, 49, 20, 1, 1, 35, 168, 168, 35, 1, 1, 56, 462, 900, 462, 56, 1, 1, 84, 1092, 3630, 3630, 1092, 84, 1, 1, 120, 2310, 12012, 20449, 12012, 2310, 120, 1, 1, 165, 4488, 34320, 91091, 91091 (list; table; graph; listen)

	OFFSET	`1,5`
	COMMENT	`beta(1,0)-trees on n+1 nodes with k leaves.`
	LINKS	`M. Bona, [math/9705220] 2-stack sortable permutations with a given number of runs`
	FORMULA	`T(k, n) = (n+k-1)!(2n-k)!/k!/(n+1-k)!/(2k-1)!/(2n-2*k+1)!.`
	CROSSREFS	`Cf. T(k, 2) = A000292(k). T(k, 3) = A051947(k).` `Sequence in context: A016520 A109955 A089447 this_sequence A056939 A142595 A140711` `Adjacent sequences: A082677 A082678 A082679 this_sequence A082681 A082682 A082683`
	KEYWORD	`nonn,tabl,easy`
	AUTHOR	`Ralf Stephan (ralf(AT)ark.in-berlin.de), May 19 2003`

page 1

Search completed in 0.002 seconds

Last modified March 19 13:18 EDT 2010. Contains 173632 sequences.

AT&T Labs Research