cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A182216 Number of permutations sortable by a double-ended queue.

This page as a plain text file.
%I A182216 #59 Aug 06 2024 10:27:50
%S A182216 1,1,2,6,24,116,634,3762,23638,154816,1046010,7239440,51069582,
%T A182216 365879686,2654987356,19473381290,144138193538,1075285161294,
%U A182216 8076634643892,61028985689976,463596673890280,3538275218777642
%N A182216 Number of permutations sortable by a double-ended queue.
%H A182216 Daniel Denton and Peter Doyle, <a href="/A182216/b182216.txt">Table of n, a(n) for n = 0..100</a>
%H A182216 Michael Albert, Mike Atkinson, Steve Linton, <a href="http://www.springerlink.com/content/h273247258k76101/">Permutations generated by stacks and deques</a>, Annals of Combinatorics, 14 (2010) 3-16. (gives method of computation).
%H A182216 Daniel Denton, Methods of computing deque sortable permutations given complete and incomplete information, <a href="http://arxiv.org/abs/1208.1532">arXiv:1208.1532</a>.
%H A182216 Stoyan Dimitrov, <a href="https://arxiv.org/abs/2103.04332">Sorting by shuffling methods and a queue</a>, arXiv:2103.04332 [math.CO], 2021.
%H A182216 Andrew Elvey-Price and Anthony J. Guttmann, <a href="http://arxiv.org/abs/1508.02273">Permutations sortable by deques and by two stacks in parallel</a>, arxiv:1508.02273, 2015
%H A182216 Philippe Flajolet, Bruno Salvy and Paul Zimmermann, <a href="https://citeseerx.ist.psu.edu/pdf/3ce789a25aaeb273bb1c17f3a020dc8cea467081">Lambda-Upsilon-Omega, The 1989 CookBook</a>, page 105.
%H A182216 Paul Zimmermann, <a href="/A182216/a182216.c.txt">C program for A182216</a>
%H A182216 P. Zimmermann, <a href="http://www.stat.purdue.edu/~mdw/ChapterIntroductions/AutomaticAnalysisZimmermann.pdf">Introduction to Automatic Analysis</a>, 2012.
%e A182216 Up to n=4 all permutations can be sorted by a double-ended queue (deque for short).
%e A182216 For n=5 the permutation 24351 cannot: you first queue 2 on either side, then 4 on either side, then 3 has to be queued on the same side as 4 otherwise it will "block" 2 between 3 and 4, but then whatever side you queue 5, you will block either 2 (between 4 and 5) or 3 (between 4 and 5).
%Y A182216 Cf. A215257, A216040, A215252.
%K A182216 nonn
%O A182216 0,3
%A A182216 _Paul Zimmermann_, Apr 19 2012
%E A182216 a(13)-a(14) confirmed by _Michael Albert_, Apr 19 2012
%E A182216 a(16)-a(21) from _Michael Albert_, Jun 27 2012
%E A182216 a(0)=1 added by _N. J. A. Sloane_, Sep 12 2012