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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007763 Number of pairs of length n permutations achievable by double-ended priority queue. 1
1, 4, 32, 392, 6488, 135360, 3408120, 100520432, 3398723928 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

M. D. Atkinson and Robert Beals, Priority queues and permutations, SIAM J Comput., 23 (1994), 1225-12430.

LINKS

Table of n, a(n) for n=1..9.

Sean A. Irvine, Notes on A007763

CROSSREFS

Cf. A000272 (single-ended priority queue).

Sequence in context: A047053 A201594 A222412 * A195193 A203435 A005263

Adjacent sequences:  A007760 A007761 A007762 * A007764 A007765 A007766

KEYWORD

nonn,more

AUTHOR

mda(AT)cs.st-andrews.ac.uk (Michael Atkinson)

EXTENSIONS

Title improved and a(7)-a(9) from Sean A. Irvine, Jan 23 2018

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 June 21 16:07 EDT 2018. Contains 305624 sequences. (Running on oeis4.)