|
|
A274970
|
|
Number of 2-stack pushall sortable permutations of length n.
|
|
1
|
|
|
1, 1, 2, 6, 24, 120, 698, 4393, 28551, 187403, 1231517, 8080058, 52905865, 345820994
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
CROSSREFS
|
Cf. A263929 (permutations sortable with two stacks in series).
Cf. A274969 (pushall stack words of length 3n).
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|