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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204841 (2n)! - 2^n*n!. 0
0, 0, 16, 672, 39936, 3624960, 478955520, 87177646080, 20922779566080, 6402373519933440, 2432902004460748800, 1124000727695858073600, 620448401731277448806400, 403291461126554623829606400, 304888344611712432172380979200, 265252859812191015786434789376000 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

a(n) is the number of ways to seat (linearly order) n married couples so that at least one couple is separated.

LINKS

Table of n, a(n) for n=0..15.

FORMULA

a(n) = A010050(n) - A000165(n).

MATHEMATICA

Table[(2n)! - 2^n n!, {n, 0, 20}]

CROSSREFS

Cf. A007060.

Sequence in context: A197407 A197429 A231936 * A264533 A253126 A014733

Adjacent sequences:  A204838 A204839 A204840 * A204842 A204843 A204844

KEYWORD

nonn

AUTHOR

Geoffrey Critzer, Jan 19 2012

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 4 23:10 EST 2016. Contains 278755 sequences.