login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A196687
n!*A062868(n).
2
1, 4, 24, 336, 5520, 203040, 7025760, 510370560, 30163311360, 3577017024000, 319851801561600, 55850407258060800, 7021439018770176000, 1692163531361176473600, 284409062346887622144000, 90395009213694143422464000, 19571060809440210728706048000, 7929132907666579072319471616000
OFFSET
1,2
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
Sequence in context: A206239 A374386 A361054 * A185457 A024250 A167140
KEYWORD
nonn
AUTHOR
Jan Lakota, Oct 04 2011
EXTENSIONS
a(1)-a(6) computed by Jan Lakota; extended by N. J. A. Sloane, Oct 04 2011
STATUS
approved