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 A079986 #11 Nov 03 2015 09:35:08
%S A079986 1,0,1,0,4,0,16,0,49,0,169,0,576,0,1936,0,6561,0,22201,0,75076,0,
%T A079986 254016,0,859329,0,2907025,0,9834496,0,33269824,0,112550881,0,
%U A079986 380757169,0,1288092100,0,4357584144,0,14741602225
%N A079986 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,0,2}.
%C A079986 a(n)=( A000073(k+2) )^2 if n=2k, a(n)=0 otherwise.
%D A079986 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 A079986 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 A079986 <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (0, 2, 0, 3, 0, 6, 0, -1, 0, 0, 0, -1).
%F A079986 a(n) = 2*a(n-2)+3*a(n-4)+6*a(n-6)-a(n-8)-a(n-12).
%F A079986 G.f.: -(x^6+x^4+x^2-1)/(x^12+x^8-6*x^6-3*x^4-2*x^2+1)
%t A079986 LinearRecurrence[{0,2,0,3,0,6,0,-1,0,0,0,-1},{1,0,1,0,4,0,16,0,49,0,169,0},50] (* _Harvey P. Dale_, Nov 03 2015 *)
%Y A079986 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%K A079986 nonn
%O A079986 0,5
%A A079986 _Vladimir Baltic_, Feb 17 2003