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 A079992 #13 Jul 29 2024 10:39:49
%S A079992 1,1,2,3,9,19,49,100,233,503,1166,2580,5884,13092,29622,66281,149569,
%T A079992 335524,755737,1697149,3819301,8582469,19306314,43397191,97600441,
%U A079992 219421360,493425528,1109386496,2494606984,5608933040,12612101201
%N A079992 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,2}.
%D A079992 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 A079992 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 A079992 <a href="/index/Rec#order_14">Index entries for linear recurrences with constant coefficients</a>, signature (1, 3, -1, 1, 1, 3, -5, -9, 1, 1, 1, -1, 1, 1).
%F A079992 a(n) = a(n-1) +3*a(n-2) -a(n-3) +a(n-4) +a(n-5) +3*a(n-6) -5*a(n-7) -9*a(n-8) +a(n-9) +a(n-10) +a(n-11) -a(n-12) +a(n-13) +a(n-14).
%F A079992 G.f.: -(x^2-1)*(x^6+x^4+x^3+x^2-1)/(x^14 +x^13 -x^12 +x^11 +x^10 +x^9 -9*x^8 -5*x^7 +3*x^6 +x^5 +x^4 -x^3 +3*x^2 +x-1)
%Y A079992 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%K A079992 nonn,easy
%O A079992 0,3
%A A079992 _Vladimir Baltic_, Feb 17 2003