login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214611 Number of permutations of length n sortable by a pop stack followed by a queue and then by a stack. 1
1, 2, 6, 24, 120, 685, 4148, 25661, 159829, 997870 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
R. Smith and V. Vatter, A stack and a pop stack in series, The Australasian Journal of Combinatorics, Volume 58(1) (2014), pp. 157-171.
EXAMPLE
There are only a(6)=685 permutations of length 6 that can be sorted by this machine; the machine can sort all shorter permutations.
CROSSREFS
Cf. A033321.
Sequence in context: A152347 A228393 A177526 * A177528 A177527 A068200
KEYWORD
nonn,hard,more
AUTHOR
Vincent Vatter, Mar 06 2013
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)