cp's OEIS Frontend

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.

A079991 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,1}.

This page as a plain text file.
%I A079991 #13 Jul 29 2024 10:38:50
%S A079991 1,1,1,2,5,13,29,58,124,280,632,1406,3101,6851,15217,33846,75181,
%T A079991 166823,370177,821760,1824620,4051056,8993220,19964240,44320545,
%U A079991 98393849,218438981,484939834,1076573833,2390015565,5305896445,11779231650
%N A079991 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,1}.
%D A079991 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 A079991 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 A079991 <a href="/index/Rec#order_14">Index entries for linear recurrences with constant coefficients</a>, signature (2, 0, 0, 3, 0, 1, -8, -1, 0, -3, 0, 0, 2, 1).
%F A079991 a(n) = 2*a(n-1) +3*a(n-4) +a(n-6) -8*a(n-7) -a(n-8) -3*a(n-10) +2*a(n-13) +a(n-14).
%F A079991 G.f.: -(x^8+x^7-x^6-2*x^4-x^2-x+1)/(x^14+2*x^13-3*x^10-x^8-8*x^7+x^6+3*x^4+2*x-1).
%Y A079991 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%K A079991 nonn,easy
%O A079991 0,4
%A A079991 _Vladimir Baltic_, Feb 17 2003