The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A184965 Number of permutations p of [n] such that (n-p(i)+i) mod n >= 6 for all i. 6

%I #29 Oct 25 2023 16:19:18

%S 1,0,0,0,0,0,0,1,2,78,888,13909,204448,3182225,51504968,873224962,

%T 15498424578,287972983669,5598118158336,113756109812283,

%U 2413723031593090,53416658591208438,1231458960862452472,29538634475147637783,736321207493996695072

%N Number of permutations p of [n] such that (n-p(i)+i) mod n >= 6 for all i.

%H Shalosh B. Ekhad and Doron Zeilberger, <a href="/A184965/b184965.txt">Table of n, a(n) for n = 0..100</a>

%H D. Zeilberger, <a href="http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/menages.html">Automatic Enumeration of Generalized Ménage Numbers</a>

%e a(8) = 2: (2,3,4,5,6,7,8,1), (3,4,5,6,7,8,1,2).

%p with(LinearAlgebra):

%p a:= n-> `if`(n=0, 1, Permanent(Matrix(n, (i, j)->

%p `if`(i-j<=0 and i-j>-6 or i-j>n-6, 0, 1)))):

%p seq(a(n), n=0..15);

%t a[n_] := Permanent[Table[If[i-j <= 0 && i-j > -6 || i-j > n-6, 0, 1], {i, 1, n}, {j, 1, n}]]; a[0] = 1; Table[an = a[n]; Print["a(", n, ") = ", an]; an, {n, 0, 15}] (* _Jean-François Alcover_, Jan 07 2016, adapted from Maple *)

%Y A diagonal of A008305.

%Y Cf. A000142, A000166, A000179, A000183, A004307.

%K nonn

%O 0,9

%A _Alois P. Heinz_, Apr 20 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 5 04:27 EDT 2024. Contains 373102 sequences. (Running on oeis4.)