Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080000
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A080000
%S A080000 1,1,1,1,1,2,3,5,7,9,12,16,24,35,50,70,96,135,190,270,383,539,759,1065,
%T A080000 1500,2116,2985,4212,5932,8356,11770,16585,23381,32953,46445,65445,
%U A080000 92216,129951,183129,258091,363719,512566,722316,1017886,1434445
%N A080000 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,1,2}.
%D A080000 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.
%F A080000 Recurrence: a(n) = a(n-1)+2*a(n-5)-a(n-6)+a(n-7)-a(n-10) G.f.: -(x^5-1)/
               (x^10-x^7+x^6-2*x^5-x+1)
%Y A080000 Cf. A002524-A002529, A072827, A072850-A072856, A079955-A080014.
%Y A080000 Sequence in context: A126256 A062438 A102424 this_sequence A032459 A028870 
               A057886
%Y A080000 Adjacent sequences: A079997 A079998 A079999 this_sequence A080001 A080002 
               A080003
%K A080000 nonn
%O A080000 0,6
%A A080000 Vladimir Baltic (baltic(AT)matf.bg.ac.yu), Feb 10 2003

    
page 1

Search completed in 0.001 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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research