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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116221 If X_1,...,X_n is a partition of a 5n-set X into 5-blocks then a(n) is equal to the number of permutations f of X such that f(X_i)<>X_i, (i=1,...n). 1
0, 3614400, 1306371456000, 2432274637386240000, 15509750490368582860800000, 265241692266421512138485760000000, 10332925158674345473855915900600320000000 (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((-120)^i*binomial(n,i)*(5*n-5*i)!,i=0..n).

EXAMPLE

a(5)=15509750490368582860800000

MAPLE

a:=n->sum((-120)^i*binomial(n, i)*(5*n-5*i)!, i=0..n).

CROSSREFS

Sequence in context: A198167 A053078 A183970 * A118813 A127229 A068158

Adjacent sequences:  A116218 A116219 A116220 * A116222 A116223 A116224

KEYWORD

nonn

AUTHOR

Milan R. Janjic (agnus(AT)blic.net), Apr 09 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 15 07:42 EST 2012. Contains 205717 sequences.