Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080009
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080009 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={2}. +0
1
1, 1, 2, 4, 11, 26, 56, 127, 288, 660, 1500, 3401, 7729, 17565, 39930, 90735, 206176, 468536, 1064750, 2419661, 5498621, 12495505, 28395889, 64529315, 146642077, 333242093, 757288191, 1720927502, 3910785158, 8887207808, 20196062308 (list; graph; listen)
OFFSET

0,3

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)+5*a(n-5)+a(n-7)-a(n-8)-a(n-9)-a(n-10) G.f.: -(x^5+x^3-1)/(x^10+x^9+x^8-x^7-5*x^5-3*x^4-2*x^3-x^2-x+1)

CROSSREFS

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

Sequence in context: A071973 A086424 A122121 this_sequence A123432 A090899 A123440

Adjacent sequences: A080006 A080007 A080008 this_sequence A080010 A080011 A080012

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 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research