login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111576 Number of minimal non-2-stack-sortable permutations of length n. 3

%I

%S 0,0,0,0,0,0,22,51,146

%N Number of minimal non-2-stack-sortable permutations of length n.

%D V. Vatter, The Enumeration and Structure of Permutation Classes, Ph. D. Dissertation, Rutgers Univ., Math. Dept., 2006.

%H M. D. Atkinson, M. M. Murphy and N. Ruskuc, <a href="https://doi.org/10.1016/S0304-3975(01)00270-5">Sorting with two ordered stacks in series</a>, Theoret. Comput. Sci. 289 (2002), 205-223.

%H R. E. Tarjan, <a href="https://doi.org/10.1145/321694.321704">Sorting using networks of queues and stacks</a>, JACM, 19 (1972), 341-346.

%K nonn,more

%O 1,7

%A _N. J. A. Sloane_, Nov 17 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 10:37 EST 2021. Contains 340269 sequences. (Running on oeis4.)