OFFSET
0,3
COMMENTS
A 2-stack pushall sortable permutation is one that can be sorted by two stacks in series by pushing all elements to the stacks before writing any element to the output.
A permutation of length n is 2-stack pushall sortable if and only if it can be sorted by a sequence of 3n operations represented by a pushall stack word of length 3n.
LINKS
Adeline Pierrot and Dominique Rossin, 2-stack pushall sortable permutations, arXiv:1303.4376 [cs.DM], 2013.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
David Bevan, Jul 13 2016
EXTENSIONS
a(11)-a(13) from Bert Dobbelaere, Dec 26 2018
STATUS
approved