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 A080002 #17 Sep 04 2022 10:50:23
%S A080002 1,0,0,0,1,1,0,0,1,3,1,1,1,6,6,4,5,10,20,16,20,25,50,60,66,85,125,190,
%T A080002 216,281,365,545,701,883,1156,1576,2176,2761,3636,4784,6560,8620,
%U A080002 11265,14856,19840,26600,34825,46045,60856,81420,107625,142055,187881,249461
%N A080002 Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={-1,0,1}.
%D A080002 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 A080002 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 A080002 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,0,1,2,-1,-1,0,0,-1).
%F A080002 Recurrence: a(n) = a(n-2)+a(n-4)+2*a(n-5)-a(n-6)-a(n-7)-a(n-10).
%F A080002 G.f.: (1-x^2-x^5)/(x^10+x^7+x^6-2*x^5-x^4-x^2+1).
%t A080002 LinearRecurrence[{0,1,0,1,2,-1,-1,0,0,-1},{1,0,0,0,1,1,0,0,1,3},60] (* _Harvey P. Dale_, Dec 14 2011 *)
%Y A080002 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%K A080002 nonn
%O A080002 0,10
%A A080002 _Vladimir Baltic_, Feb 10 2003