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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093346 Array read by antidiagonals: T(r,n) = number of two-stack sortable r-permutations. 0
1, 1, 2, 1, 3, 6, 1, 4, 15, 22, 1, 5, 28, 95, 91, 1, 6, 45, 252, 690, 408, 1, 7, 66, 525, 2618, 5481, 1938, 1, 8, 91, 946, 7095, 29848, 46376, 9614, 1, 9, 120, 1547, 15741, 105417, 363216, 411255, 49335, 1, 10, 153, 2360, 30576, 288288, 1673535 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,3

LINKS

D. Xu, Generalizations of two-stack-sortable permutations, PhD thesis.

FORMULA

T(r, n) = 2(r+1) * ((2r+1)n)!/[n!*(2rn+2)! ]

PROG

(PARI) T(r, n)=2*(r+1)*((2*r+1)*n)!/(n!*(2*r*n+2)!)

CROSSREFS

Sequence in context: A035206 A181511 A115196 * A115597 A103371 A120257

Adjacent sequences:  A093343 A093344 A093345 * A093347 A093348 A093349

KEYWORD

nonn,tabl

AUTHOR

Ralf Stephan, Apr 26 2004

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 17 10:57 EST 2012. Contains 206009 sequences.