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 #12 Jul 19 2015 19:37:12
%S 1,0,1,2,9,44,265,1854,14833,133496,1334961,14684570,145510740,
%T 1314803006,11013531389,87155940048,663875231097,4947896842392,
%U 36563337902968,270617834212996,2021217246729905,15317729587621252,118254506519672137,924131987256868248
%N Number of permutations p of [n] with no fixed points and displacement of elements restricted by ten: 1 <= |p(i)-i| <= 10.
%C Conjecture: Column k > 0 of A259776 has a linear recurrence (with constant coefficients) of order = A005317(k) = (2^k + C(2*k,k))/2. For k=10 is conjectured recurrence order 92890. - _Vaclav Kotesovec_, Jul 07 2015
%H Alois P. Heinz, <a href="/A259783/b259783.txt">Table of n, a(n) for n = 0..175</a>
%Y Column k=10 of A259776.
%Y Cf. A260216.
%K nonn
%O 0,4
%A _Alois P. Heinz_, Jul 05 2015