A127888 - OEIS

This site is supported by donations to The OEIS Foundation.

A127888

If X_1,...,X_n is a partition of a 6n-set X into 6-blocks then a(n) is equal to the number of permutations f of X such that f(X_i)<>X_i, (i=1,...n).

0, 478483200, 6401339808768000, 620429964386047303680000, 265250626231132937174895820800000, 371992180902371387782970387300352000000000 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	LINKS	`Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets`
	FORMULA	`a(n)=sum((-720)^ibinomial(n,i)(6n-6i)!,i=0..n).`
	EXAMPLE	`a(5)=265250626231132937174895820800000`
	MAPLE	`a:=n->sum((-720)^ibinomial(n, i)(6n-6i)!, i=0..n).`
	CROSSREFS	`Sequence in context: A038819 A091677 A147717 * A072232 A011523 A172535` `Adjacent sequences: A127885 A127886 A127887 * A127889 A127890 A127891`
	KEYWORD	`nonn`
	AUTHOR	`Milan R. Janjic (agnus(AT)blic.net), Apr 09 2007`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 19:37 EST 2012. Contains 205663 sequences.