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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111576 Number of minimal non-2-stack-sortable permutations of length n. 3
0, 0, 0, 0, 0, 0, 22, 51, 146 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

REFERENCES

M. D. Atkinson, M. M. Murphy and N. Ruskuc, Sorting with two ordered stacks in series, Theoret. Comput. Sci. 289 (2002), 205-223.

R. E. Tarjan, Sorting using networks of queues and stacks, JACM, 19 (1972), 341-346.

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

LINKS

Table of n, a(n) for n=1..9.

CROSSREFS

Sequence in context: A092221 A191279 A200880 * A277979 A177726 A101571

Adjacent sequences:  A111573 A111574 A111575 * A111577 A111578 A111579

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Nov 17 2005

STATUS

approved

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 March 21 21:34 EDT 2019. Contains 321382 sequences. (Running on oeis4.)