Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086854
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A086854
%S A086854 0,0,0,0,2,16,120,888,7198,64968,650644,7165200,86059242,1119549472,15682257872,
%T A086854 235336043976,3766695159030,64052134910168,1153211148654348,21915344800505888,
%U A086854 438380075974889154,9207290871553008240,202585136417883766472,4659950328485470292632
%N A086854 Number of permutations of length n with exactly 3 rising or falling successions.
%C A086854 Permutations of 12...n such that exactly 3 of the following occur: 12, 
               23, ..., (n-1)n, 21, 32, ..., n(n-1).
%D A086854 F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied 
               Tables, Cambridge, 1966, p. 263.
%D A086854 J. Riordan, A recurrence for permutations without rising or falling successions. 
               Ann. Math. Statist. 36 (1965), 708-710.
%F A086854 Coefficient of t^3 in S[n](t) defined in A002464.
%Y A086854 Cf. A002464, A000130, A000349, A001267, A086852, A086853. A diagonal 
               of A001100.
%Y A086854 Sequence in context: A136782 A112710 A046105 this_sequence A026129 A026158 
               A025185
%Y A086854 Adjacent sequences: A086851 A086852 A086853 this_sequence A086855 A086856 
               A086857
%K A086854 nonn
%O A086854 0,5
%A A086854 N. J. A. Sloane (njas(AT)research.att.com), Aug 19 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 December 5 08:23 EST 2009. Contains 170348 sequences.


AT&T Labs Research