id:A137801 - OEIS Search Results

Search: id:A137801

Displaying 1-1 of 1 results found.

page 1

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).

+0
2

0, 6, 900, 748440, 1559930400, 6928346502000, 58160619655538400, 845986566719614320000, 19957466912796971445888000, 724891264860942581350908960000, 38873628093261330554954970801600000 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`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 (maxal(AT)cs.ucsd.edu), Nov 03 2008]`
	PROGRAM	`(PARI) { a(n) = n! * sum(i=0, n, (-1)^i * sum(j=0, n-i, (2n)! (2n-i-2j)! / (n-i-j)! / i! / j! / 2^(2n-2i-j) ) ) }`
	CROSSREFS	`Cf. A094047, A137802.` `Sequence in context: A006114 A078927 A064430 this_sequence A076667 A000652 A145250` `Adjacent sequences: A137798 A137799 A137800 this_sequence A137802 A137803 A137804`
	KEYWORD	`nonn`
	AUTHOR	`Max Alekseyev (maxal(AT)cs.ucsd.edu), Feb 10 2008`

page 1

Search completed in 0.002 seconds

Last modified December 3 01:16 EST 2008. Contains 151161 sequences.

AT&T Labs Research