The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080003 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,2}. 0
 1, 1, 1, 1, 4, 8, 13, 22, 40, 77, 140, 252, 456, 834, 1525, 2775, 5049, 9195, 16760, 30536, 55617, 101304, 184544, 336193, 612424, 1115600, 2032216, 3702000, 6743761, 12284729, 22378393, 40765513, 74260396, 135276192, 246425309 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 REFERENCES 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. LINKS Table of n, a(n) for n=0..34. Vladimir Baltic, On the number of certain types of strongly restricted permutations, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (2010), 119-135 Index entries for linear recurrences with constant coefficients, signature (1,0,1,2,2,0,1,-1,0,-1). FORMULA Recurrence: a(n) = a(n-1)+a(n-3)+2*a(n-4)+2*a(n-5)+a(n-7)-a(n-8)-a(n-10). G.f.: -(x^5+x^3-1)/(x^10+x^8-x^7-2*x^5-2*x^4-x^3-x+1) CROSSREFS Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014. Sequence in context: A265258 A009852 A323951 * A033016 A027008 A114997 Adjacent sequences: A080000 A080001 A080002 * A080004 A080005 A080006 KEYWORD nonn,changed AUTHOR Vladimir Baltic, Feb 10 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 20 00:26 EDT 2024. Contains 371798 sequences. (Running on oeis4.)