|
| |
|
|
A027361
|
|
Number of "sorted permutations": permutations that can occur as the output of the sorting procedure described by Knuth.
|
|
1
| |
|
|
1, 1, 2, 5, 17, 68, 326, 1780, 11033, 76028, 578290, 4803696, 43297358, 420639362, 4382320595, 48729809104, 576039659209, 7213070102518, 95373808983223, 1327842798808220, 19416307366048221
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
REFERENCES
| M. Bousquet-Melou, Sorted or sortable permutations, Discrete Math., 225 (2000), 25-50.
D. E. Knuth, The Art of Computer Programming Vol. 1, p. 238.
J. West, Sorting twice through a stack, Theroret. Comput. Sci. 117 (1993) 303-313.
|
|
|
LINKS
| M. Bousquet-M\'{e}lou, Sorted or sortable permutations
Index entries for sequences related to sorting
|
|
|
CROSSREFS
| Cf. A027432.
Sequence in context: A003510 A051625 A056098 * A101971 A162037 A183239
Adjacent sequences: A027358 A027359 A027360 * A027362 A027363 A027364
|
|
|
KEYWORD
| nonn,nice
|
|
|
AUTHOR
| Mireille BOUSQUET-MELOU (bousquet(AT)labri.u-bordeaux.fr)
|
| |
|
|
