login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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, 6240672, 39111747, 245782289, 1549368610
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
EXTENSIONS
a(11)-a(14) from Bert Dobbelaere, Jun 18 2024
STATUS
approved