# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a027361
Showing 1-1 of 1

%I A027361 #23 Apr 21 2015 16:45:32
%S A027361 1,1,1,2,5,17,68,326,1780,11033,76028,578290,4803696,43297358,
%T A027361 420639362,4382320595,48729809104,576039659209,7213070102518,
%U A027361 95373808983223,1327842798808220,19416307366048221,297499363267839558,4766432683120731044,79699553284422816437,1388383661114307067780,25156549558328842669336
%N A027361 Number of "sorted permutations": permutations that can occur as the output of the sorting procedure described by Knuth.
%D A027361 D. E. Knuth, The Art of Computer Programming Vol. 1, p. 238.
%H A027361 M. Bousquet-Mélou, <a href="http://www.labri.fr/perso/bousquet/publis.html">Publications de Mireille Bousquet-Mélou</a>
%H A027361 M. Bousquet-Mélou, <a href="http://dx.doi.org/10.1016/S0012-365X(00)00146-1">Sorted or sortable permutations</a>, Discrete Math., 225 (2000), 25-50.
%H A027361 J. West, <a href="http://dx.doi.org/10.1016/0304-3975(93)90321-J">Sorting twice through a stack</a>, Theoret. Comput. Sci. 117 (1993) 303-313.
%H A027361 <a href="/index/So#sorting">Index entries for sequences related to sorting</a>
%Y A027361 Cf. A027432.
%K A027361 nonn,nice
%O A027361 0,4
%A A027361 _Mireille Bousquet-Mélou_
%E A027361 Prepended a(0)=1 to match offset, added more terms, _Joerg Arndt_, Jul 01 2014

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE