|
Search: id:A002484
|
|
|
| A002484 |
|
Number of menage permutations.
(Formerly M1524 N0597)
|
|
+0
1
|
|
| 1, 2, 5, 20, 87, 616, 4843, 44128, 444621, 4936274, 59661265, 780547332, 10987097799, 165587196328, 2660378564791, 45392026278108, 819716784789209, 15620011000052754, 313219935456572497, 6593238656843759572
(list; graph; listen)
|
|
|
OFFSET
|
3,2
|
|
|
REFERENCES
|
C. Berge, Principles of Combinatorics. Academic Press, NY, 1971, p. 162.
E. N. Gilbert, Knots and classes of menage permutations. Scripta Math. 22 (1956), 228-233 (1957).
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 195.
|
|
FORMULA
|
Gilbert gives a formula (see Maple code).
|
|
MAPLE
|
with(numtheory): d := n->divisors(n): U := (m, t)->sum(2*m*binomial(2*m-k, k)*(m-k)!*(t-1)^k/(2*m-k), k=0..m): A := (n, i)->phi(n/dd[i])*(n/dd[i])^dd[i]*U(dd[i], 1-dd[i]/n)/n: for n from 3 to 28 do dd := d(n): B := [seq(A(n, j), j=1..nops(dd))]: a[n] := sum(B[i], i=1..nops(B)) od: seq(a[n], n=3..28);
|
|
CROSSREFS
|
Adjacent sequences: A002481 A002482 A002483 this_sequence A002485 A002486 A002487
Sequence in context: A008983 A012768 A006228 this_sequence A003069 A115082 A020105
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms and Maple code from Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 08 2004
|
|
|
Search completed in 0.002 seconds
|
