login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A274970 Number of 2-stack pushall sortable permutations of length n. 1
1, 1, 2, 6, 24, 120, 698, 4393, 28551, 187403, 1231517 (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.

LINKS

Table of n, a(n) for n=0..10.

Adeline Pierrot and Dominique Rossin, 2-stack pushall sortable permutations.

CROSSREFS

Permutations sortable with two stacks in series A263929.

Pushall stack words of length 3n A274969. 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.

Sequence in context: A068200 A189847 A189284 * A177525 A177532 A242573

Adjacent sequences:  A274967 A274968 A274969 * A274971 A274972 A274973

KEYWORD

nonn,more

AUTHOR

David Bevan, Jul 13 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 06:02 EDT 2018. Contains 316432 sequences. (Running on oeis4.)