|
%I #14 Mar 31 2012 14:40:10
%S 1,2,6,18,54,146,391,1081,3004,8320,22984,63424,175176,484113,1337721,
%T 3695886,10210702,28209954,77940078,215337554,594943087,1643728129,
%U 4541349672,12547013504,34665373744,95774808224,264610227072
%N Number of permutations satisfying i-2<=p(i)<=i+4, i=1..n.
%H R. H. Hardin, <a href="/A072850/b072850.txt">Table of n, a(n) for n=1..400</a>
%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 - 1) + 2*a(n - 2) + 4*a(n - 3) + 6*a(n - 4) + 10*a(n - 5) + 12*a(n - 6) - 4*a(n - 7) - 6*a(n - 8) - 6*a(n - 9) - 2*a(n - 11) - 2*a(n - 12) + a(n - 14) + a(n - 15).
%F G.f.: - (x^9 + x^7 - 2*x^6 - 2*x^4 - 2*x^3 - x^2 + 1)/(x^15 + x^14 - 2*x^12 - 2*x^11 - 6*x^9 - 6*x^8 - 4*x^7 + 12*x^6 + 10*x^5 + 6*x^4 + 4*x^3 + 2*x^2 + x - 1)
%Y Cf. A002524..A002529, A072827, A072850..A072856, A079955..A080014.
%K nonn
%O 1,2
%A _Vladimir Baltic_, Jul 25 2002
|
