Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080010
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080010 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
1
1, 1, 1, 3, 9, 19, 38, 84, 193, 430, 940, 2074, 4609, 10223, 22611, 50022, 110780, 245348, 543189, 1202511, 2662417, 5894961, 13051820, 28897016, 63979205, 141653762, 313629217, 694390210, 1537413824, 3403913006, 7536438344 (list; graph; listen)
OFFSET

0,4

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.

FORMULA

Recurrence: a(n) = a(n-1)+a(n-2)+2*a(n-3)+3*a(n-4)+3*a(n-5)-2*a(n-6)-a(n-7)-a(n-10) G.f.: -(x^5+x^3+x^2-1)/(x^10+x^7+2*x^6-3*x^5-3*x^4-2*x^3-x^2-x+1)

CROSSREFS

Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.

Sequence in context: A014540 A115238 A005994 this_sequence A135117 A038163 A075188

Adjacent sequences: A080007 A080008 A080009 this_sequence A080011 A080012 A080013

KEYWORD

nonn

AUTHOR

Vladimir Baltic (baltic(AT)galeb.etf.bg.ac.yu), Feb 10 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research