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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116220 If X_1,...,X_n is a partition of a 4n-set X into 4-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, 39744, 476126208, 20876944084992, 2430394026897309696, 620098244484731975761920, 304784138698487640049544331264, 263072308376236973471661993731555328 (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((-24)^i*binomial(n,i)*(4*n-4*i)!,i=0..n).

EXAMPLE

a(5)=2430394026897309696

MAPLE

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

CROSSREFS

Sequence in context: A004671 A162866 A204311 * A103809 A076670 A106772

Adjacent sequences:  A116217 A116218 A116219 * A116221 A116222 A116223

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 14 11:14 EST 2012. Contains 205619 sequences.