References to A000179

Menage numbers: number of permutations s of [0, ..., n-1] such that s(i) != i and s(i) != i+1 (mod n) for all i.
1, 0, 0, 1, 2, 13, 80, 579, 4738, 43387, 439792, 4890741, 59216642, 775596313


9 seqfan posts

Wed Jan 19 16:06:48 CET 2011    [seqfan] Re: A combinatorial problem
Mon Jan 17 18:14:37 CET 2011    [seqfan] Re: A combinatorial problem
Fri Jan 14 19:26:41 CET 2011    [seqfan] Re: A combinatorial problem
Fri Jan 14 16:56:52 CET 2011    [seqfan] Re: A combinatorial problem
Fri Jan 14 13:19:13 CET 2011    [seqfan] A combinatorial problem
Fri Oct 29 05:35:16 CEST 2010    [seqfan] Implementing first 500 sequences in Java
Sun Apr 4 06:43:01 CEST 2010    [seqfan] Re:Riordan's classical formula and Juric's calculations
Sun Apr 4 06:33:09 CEST 2010    [seqfan] Riordan's classical formula and Juric's calculations
Fri Apr 2 09:53:53 CEST 2010    [seqfan] Riordan's classical formula and Juric's calculations

Index of A-numbers in seqfan: by ascending order    by month    by frequency    by keyword
Links to OEIS content are included according to The OEIS End-User License Agreement .