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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
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

%I #22 May 20 2017 21:41:42

%S 1,2,6,24,120,685,4148,25661,159829,997870

%N Number of permutations of length n sortable by a pop stack followed by a queue and then by a stack.

%H R. Smith and V. Vatter, <a href="https://ajc.maths.uq.edu.au/pdf/58/ajc_v58_p157.pdf">A stack and a pop stack in series</a>, The Australasian Journal of Combinatorics, Volume 58(1) (2014), pp. 157-171.

%e There are only a(6)=685 permutations of length 6 that can be sorted by this machine; the machine can sort all shorter permutations.

%Y Cf. A033321.

%K nonn,hard,more

%O 1,2

%A _Vincent Vatter_, Mar 06 2013

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 December 7 01:45 EST 2023. Contains 367616 sequences. (Running on oeis4.)