Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111576
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111576 Number of minimal non-2-stack-sortable permutations of length n. +0
4
0, 0, 0, 0, 0, 0, 22, 51, 146 (list; graph; listen)
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.

CROSSREFS

Sequence in context: A043948 A015226 A092221 this_sequence A101571 A122502 A063302

Adjacent sequences: A111573 A111574 A111575 this_sequence A111577 A111578 A111579

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Nov 17 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 5 23:38 EST 2009. Contains 170428 sequences.


AT&T Labs Research