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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258667 A total of n married couples, including a mathematician M and his wife, are to be seated at the 2n chairs around a circular table, with no man seated next to his wife. After the ladies are seated at every other chair, M is the first man allowed to choose one of the remaining chairs. The sequence gives the number of ways of seating the other men, with no man seated next to his wife, if M chooses the chair that is 9 seats clockwise from his wife's chair. 8
0, 0, 0, 0, 0, 20, 116, 791, 6205, 55004, 543596, 5922929, 70518903, 910711188, 12678337924, 189252400363, 3015217931281, 51067619058668, 916176426367084, 17355904144230373, 346195850528456683, 7252654441430368404, 159210363452786908116, 3654550890657000160319 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

COMMENTS

This is a variation of the classic ménage problem (cf. A000179).

It is known [Riordan, ch. 8, ex. 7(b)] that, after the ladies are seated at every other chair, the number U_n of ways of seating the men in the ménage problem has asymptotic expansion U_n ~ e^(-2)*n!*(1 + sum{k>=1}(-1)^k/(k!(n-1)_k)), where (n)_k = n*(n-1)*...*(n-k+1).

Therefore, it is natural to conjecture that a(n) ~ e^(-2)*n!/(n-2)*(1 + sum{k>=1}(-1)^k/(k!(n-1)_k)).

REFERENCES

I. Kaplansky and J. Riordan, The problème des ménages, Scripta Math. 12, (1946), 113-124.

E. Lucas, Théorie des nombres, Paris, 1891, 491-496.

J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, chs. 7, 8.

J. Touchard, Sur un problème de permutations, C. R. Acad. Sci. Paris, 198 (1934), 631-633.

LINKS

Table of n, a(n) for n=1..24.

Peter J. C. Moses, Seatings for 6 couples

Vladimir Shevelev, Peter J. C. Moses, The ménage problem with a known mathematician, arXiv:1101.5321 [math.CO], 2011-2015.

Vladimir Shevelev and Peter J. C. Moses, Alice and Bob go to dinner: A variation on menage, INTEGERS, Vol. 16(2016), #A72.

FORMULA

For n<=5, a(n)=0; otherwise a(n) = Sum_{0<=k<=n-1}(-1)^k*(n-k-1)! Sum_{max(k-n+5, 0)<=j<=min(k,4)}binomial(8-j, j)*binomial(2*n-k+j-10, k-j).

MATHEMATICA

a[n_] := If[n<6, 0, Sum[(-1)^k (n-k-1)! Sum[Binomial[8-j, j] Binomial[2n-k+j-10, k-j], {j, Max[k-n+5, 0], Min[k, 4]}], {k, 0, n-1}]];

Array[a, 24] (* Jean-François Alcover, Sep 19 2018 *)

PROG

(PARI) a(n) = if (n<=5, 0, sum(k=0, n-1, (-1)^k*(n-k-1)!*sum(j=max(k-n+5, 0), min(k, 4), binomial(8-j, j)*binomial(2*n-k+j-10, k-j)))); \\ Michel Marcus, Jun 26 2015

CROSSREFS

Cf. A000179, A258664, A258665, A258666, A258673, A259212.

Sequence in context: A271494 A220928 A206368 * A299965 A244289 A293880

Adjacent sequences:  A258664 A258665 A258666 * A258668 A258669 A258670

KEYWORD

nonn

AUTHOR

Vladimir Shevelev and Peter J. C. Moses, Jun 07 2015

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 October 20 12:34 EDT 2018. Contains 316379 sequences. (Running on oeis4.)