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 A080005 #23 Jan 03 2017 02:47:10
%S A080005 1,1,1,2,4,7,11,19,35,62,107,186,328,578,1012,1771,3107,5455,9568,
%T A080005 16774,29417,51603,90513,158741,278404,488301,856448,1502116,2634532,
%U A080005 4620700,8104269,14214069,24929981,43724610,76688540,134503903,235906039
%N A080005 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,1}.
%D A080005 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 A080005 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 A080005 K. Edwards, M. A. Allen, <a href="http://dx.doi.org/10.1016/j.dam.2015.02.004">Strongly restricted permutations and tiling with fences</a>, Discrete Applied Mathematics, Volume 187, 31 May 2015, Pages 82-90.
%H A080005 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,1,1,-2,0,1,0,-1).
%F A080005 a(n) = a(n-1) + a(n-2) + a(n-4) + a(n-5) - 2*a(n-6) + a(n-8) - a(n-10), n>9.
%F A080005 G.f.: -(x^5+x^2-1)/(x^10-x^8+2*x^6-x^5-x^4-x^2-x+1).
%t A080005 CoefficientList[Series[-(x^5 + x^2 - 1)/(x^10 - x^8 + 2*x^6 - x^5 - x^4 - x^2 - x + 1), {x, 0, 50}], x] (* _Wesley Ivan Hurt_, Jan 02 2017 *)
%Y A080005 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%K A080005 nonn
%O A080005 0,4
%A A080005 _Vladimir Baltic_, Feb 10 2003