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.

A080006 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,2}.

This page as a plain text file.
%I A080006 #15 Apr 16 2024 03:21:45
%S A080006 1,0,1,1,3,5,8,16,27,51,91,164,298,536,972,1755,3172,5735,10363,18735,
%T A080006 33861,61204,110628,199957,361427,653277,1180800,2134300,3857748,
%U A080006 6972892,12603513,22780876,41176481,74426569,134526179,243156337
%N A080006 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,2}.
%D A080006 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 A080006 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 A080006 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0,1,2,2,3,1,0,-1,-1,-1).
%F A080006 a(n) = a(n-2)+2*a(n-3)+2*a(n-4)+3*a(n-5)+a(n-6)-a(n-8)-a(n-9)-a(n-10).
%F A080006 G.f.: -(x^5+x^3-1)/(x^10+x^9+x^8-x^6-3*x^5-2*x^4-2*x^3-x^2+1)
%Y A080006 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%K A080006 nonn
%O A080006 0,5
%A A080006 _Vladimir Baltic_, Feb 10 2003