Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Jan 06 2016 13:54:04
%S 1,0,1,2,9,44,265,1854,14833,133496,1334961,14684570,176214841,
%T 2290792932,32071101049,481066515734,7697064251745,130850092279664,
%U 2355301661033953,44750731559645106,895014631192902121,18795307255050944540,145060238642780180480,1118480911876659396600
%N Number of permutations p of [n] with no fixed points and cyclic displacement of elements restricted by ten: p(i)<>i and (i-p(i) mod n <= 10 or p(i)-i mod n <= 10).
%C a(n) = A000166(n) for n <= 21.
%p a:= n-> `if`(n=0, 1, LinearAlgebra[Permanent](Matrix(n, (i, j)->
%p `if`(i<>j and (i-j mod n<=10 or j-i mod n<=10), 1, 0)))):
%p seq(a(n), n=0..22);
%t a[n_] := If[n == 0, 1, Permanent[Table[If[i != j && (Mod[i - j, n] <= 10 || Mod[j - i, n] <= 10), 1, 0], {i, 1, n}, {j, 1, n}]]]; Table[an = a[n]; Print["a(", n, ") = ", an]; an, {n, 0, 22}] (* _Jean-François Alcover_, Jan 06 2016, adapted from Maple *)
%Y Cf. A000166, A260074, A260081, A260092, A260094, A260111, A260091, A260115, A257953.
%Y Cf. A259783.
%K nonn
%O 0,4
%A _Alois P. Heinz_, Jul 19 2015