|
%I #8 Mar 31 2012 14:40:11
%S 1,0,0,1,1,1,1,2,4,3,4,8,10,13,16,24,36,43,59,85,115,156,207,289,401,
%T 533,729,1002,1368,1864,2526,3465,4740,6436,8785,11995,16375,22331,
%U 30420,41550,56705,77296,105456,143874,196321,267792,365216,498356
%N 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={-1,0,2}.
%D 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 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 (April, 2010), 119-135
%F Recurrence: a(n) = a(n-3)+a(n-4)+2*a(n-5)-a(n-9)-a(n-10) G.f.: -(x^5-1)/(x^10+x^9-2*x^5-x^4-x^3+1)
%Y Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%K nonn
%O 0,8
%A _Vladimir Baltic_, Feb 10 2003
|
