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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

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

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.

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.

CROSSREFS

Sequence in context: A191279 A200880 A330409 * A277979 A177726 A101571

Adjacent sequences:  A111573 A111574 A111575 * A111577 A111578 A111579

KEYWORD

nonn,more

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 November 25 10:26 EST 2020. Contains 338623 sequences. (Running on oeis4.)