cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A260216 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).

This page as a plain text file.
%I A260216 #8 Jan 06 2016 13:54:04
%S A260216 1,0,1,2,9,44,265,1854,14833,133496,1334961,14684570,176214841,
%T A260216 2290792932,32071101049,481066515734,7697064251745,130850092279664,
%U A260216 2355301661033953,44750731559645106,895014631192902121,18795307255050944540,145060238642780180480,1118480911876659396600
%N A260216 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 A260216 a(n) = A000166(n) for n <= 21.
%p A260216 a:= n-> `if`(n=0, 1, LinearAlgebra[Permanent](Matrix(n, (i, j)->
%p A260216         `if`(i<>j and (i-j mod n<=10 or j-i mod n<=10), 1, 0)))):
%p A260216 seq(a(n), n=0..22);
%t A260216 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 A260216 Cf. A000166, A260074, A260081, A260092, A260094, A260111, A260091, A260115, A257953.
%Y A260216 Cf. A259783.
%K A260216 nonn
%O A260216 0,4
%A A260216 _Alois P. Heinz_, Jul 19 2015