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.
%I A079982 #16 Apr 16 2024 10:34:48
%S A079982 1,0,0,0,0,1,1,0,0,0,1,4,1,1,1,1,10,10,7,7,11,20,50,40,49,61,85,175,
%T A079982 225,265,323,461,665,1085,1310,1728,2290,3171,4767,6489,8618,11374,
%U A079982 15751,21813,31263,41749,56596,76735,105514,147726,202628,276079,374275
%N A079982 Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={-1,0,1,2}.
%C A079982 Also, number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={-2,-1,0,1}.
%D A079982 D. H. Lehmer, Permutations with strongly restricted displacements. Combinatorial theory and its applications, II (Proc. Colloq., Balatonfured, 1969), pp. 755-770. North-Holland, Amsterdam, 1970.
%H A079982 Vladimir Baltic, <a href="http://pefmath.etf.rs/vol4num1/AADM-Vol4-No1-119-135.pdf">On the number of certain types of strongly restricted permutations</a>, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (2010), 119-135.
%H A079982 <a href="/index/Rec#order_20">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,0,0,2,3,-1,-3,1,-1,-1,-3,1,3,-2,0,0,1,0,-1).
%F A079982 Recurrence: a(n) = a(n-2)+2*a(n-5)+3*a(n-6)-a(n-7)-3*a(n-8)+a(n-9)-a(n-10)-a(n-11)-3*a(n-12)+a(n-13)+3*a(n-14)-2*a(n-15)+a(n-18)-a(n-20).
%F A079982 G.f.: -(x^14-x^12+x^9-2*x^8+2*x^6+x^5+x^2-1)/(x^20-x^18+2*x^15-3*x^14-x^13+3*x^12+x^11+x^10-x^9+3*x^8+x^7-3*x^6-2*x^5-x^2+1).
%t A079982 LinearRecurrence[{0,1,0,0,2,3,-1,-3,1,-1,-1,-3,1,3,-2,0,0,1,0,-1},{1,0,0,0,0,1,1,0,0,0,1,4,1,1,1,1,10,10,7,7},60] (* _Harvey P. Dale_, Dec 19 2021 *)
%Y A079982 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%K A079982 nonn,easy
%O A079982 0,12
%A A079982 _Vladimir Baltic_, Feb 17 2003