login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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

%I

%S 1,4,32,392,6488,135360,3408120,100520432,3398723928

%N Number of pairs of length n permutations achievable by double-ended priority queue.

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

%H Sean A. Irvine, <a href="/A007763/a007763.pdf">Notes on A007763</a>

%Y Cf. A000272 (single-ended priority queue).

%K nonn,more

%O 1,2

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

%E Title improved and a(7)-a(9) from _Sean A. Irvine_, Jan 23 2018

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 19 09:06 EDT 2020. Contains 337178 sequences. (Running on oeis4.)