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.

A080007 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={0,1}.

This page as a plain text file.
%I A080007 #15 Apr 16 2024 03:21:54
%S A080007 1,0,0,1,2,4,4,8,19,32,56,97,180,336,592,1064,1925,3488,6312,11345,
%T A080007 20486,37028,66852,120688,217767,393216,710032,1281729,2313896,
%U A080007 4177216,7541568,13615344,24579657,44374528,80111088,144628065,261102474
%N A080007 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={0,1}.
%D A080007 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 A080007 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 A080007 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,2,2,4,0,-2,-1,0,-1).
%F A080007 a(n) = a(n-2)+2*a(n-3)+2*a(n-4)+4*a(n-5)-2*a(n-7)-a(n-8)-a(n-10).
%F A080007 G.f.: -(x^5+x^3+x^2-1)/(x^10+x^8+2*x^7-4*x^5-2*x^4-2*x^3-x^2+1)
%Y A080007 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%K A080007 nonn
%O A080007 0,5
%A A080007 _Vladimir Baltic_, Feb 10 2003