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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A196688 ((n!)^2-A196687(n))/2. 2
0, 0, 6, 120, 4440, 157680, 9187920, 557665920, 50759291520, 4795586208000, 636749560339200, 86796062772249600, 15877174512431232000, 2953945462595410483200, 712801595188655900928000, 173684063741850454560768000, 53471242848053479728254976000, 16530628080065352033845256192000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

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

LINKS

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

CROSSREFS

Cf. A062868, A196687. Equals n!*A179567(n).

Sequence in context: A029697 A248045 A280627 * A126448 A126446 A057003

Adjacent sequences:  A196685 A196686 A196687 * A196689 A196690 A196691

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

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 December 11 01:07 EST 2019. Contains 329910 sequences. (Running on oeis4.)