login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137801 Number of arrangements of 2n couples into n cars such that each car contains 2 men and 2 women but no couple (cars are labeled). 1
0, 6, 900, 748440, 1559930400, 6928346502000, 58160619655538400, 845986566719614320000, 19957466912796971445888000, 724891264860942581350908960000, 38873628093261330554954970801600000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Proof of the formula (in Russian).

FORMULA

a(n) = n! * A137802(n) = n! * SUM[i+j<=n] (-1)^i * (2n)! * (2n-i-2j)! / (n-i-j)! / i! / j! / 2^(2n-2i-j)

a(n) = A000459(n) * (2n)! / 2^n = A000316(n) * (2n)! / 4^n [From Max Alekseyev, Nov 03 2008]

PROG

(PARI) { a(n) = n! * sum(i=0, n, (-1)^i * sum(j=0, n-i, (2*n)! * (2*n-i-2*j)! / (n-i-j)! / i! / j! / 2^(2*n-2*i-j) ) ) }

CROSSREFS

Cf. A094047, A137802.

Sequence in context: A279304 A180992 A229629 * A076667 A000652 A214638

Adjacent sequences:  A137798 A137799 A137800 * A137802 A137803 A137804

KEYWORD

nonn

AUTHOR

Max Alekseyev, Feb 10 2008

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 November 30 21:20 EST 2021. Contains 349426 sequences. (Running on oeis4.)