Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086852
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A086852
%S A086852 0,0,2,4,10,40,230,1580,12434,110320,1090270,11876980,141373610,1825321016,
%T A086852 25405388150,379158271420,6039817462210,102278890975360,1834691141852174,
%U A086852 34752142215026180,693126840194499290,14519428780464454600,318705819455462421670
%N A086852 Number of permutations of length n with exactly 1 rising or falling succession.
%C A086852 Permutations of 12...n such that exactly one of the following occur: 
               12, 23, ..., (n-1)n, 21, 32, ..., n(n-1).
%D A086852 F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied 
               Tables, Cambridge, 1966, p. 263.
%D A086852 J. Riordan, A recurrence for permutations without rising or falling successions. 
               Ann. Math. Statist. 36 (1965), 708-710.
%F A086852 Coefficient of t^1 in S[n](t) defined in A002464.
%Y A086852 Cf. A002464, A086853, A086854, A000349, A001267. Twice A000130. A diagonal 
               of A001100.
%Y A086852 Sequence in context: A109460 A108801 A111022 this_sequence A084737 A153757 
               A159860
%Y A086852 Adjacent sequences: A086849 A086850 A086851 this_sequence A086853 A086854 
               A086855
%K A086852 nonn
%O A086852 0,3
%A A086852 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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research