cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A196687 n!*A062868(n).

Original entry on oeis.org

1, 4, 24, 336, 5520, 203040, 7025760, 510370560, 30163311360, 3577017024000, 319851801561600, 55850407258060800, 7021439018770176000, 1692163531361176473600, 284409062346887622144000, 90395009213694143422464000, 19571060809440210728706048000, 7929132907666579072319471616000
Offset: 1

Views

Author

Jan Lakota, Oct 04 2011

Keywords

Comments

Let p = (p1..pn) and q = (q1..qn) be two random permutations of (1..n); call the pair (p,q) balanced if the number of i with pi > qi is the same as the number of i with pi < qi. Then a(n) is the number of balanced pairs.

Crossrefs

Extensions

a(1)-a(6) computed by Jan Lakota; extended by N. J. A. Sloane, Oct 04 2011