login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000349 One-half the number of permutations of length n with exactly 2 rising or falling successions.
(Formerly M3932 N1617)
9

%I M3932 N1617 #23 Dec 19 2021 09:29:55

%S 0,0,0,1,5,24,128,835,6423,56410,554306,6016077,71426225,920484892,

%T 12793635300,190730117959,3035659077083,51371100102990,

%U 920989078354838,17437084517068465,347647092476801301,7280060180210901232,159755491837445900120,3665942433747225901707

%N One-half the number of permutations of length n with exactly 2 rising or falling successions.

%C (1/2) times number of permutations of 12...n such that exactly 2 of the following occur: 12, 23, ..., (n-1)n, 21, 32, ..., n(n-1).

%D F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 263.

%D J. Riordan, A recurrence for permutations without rising or falling successions. Ann. Math. Statist. 36 (1965), 708-710.

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Alois P. Heinz, <a href="/A000349/b000349.txt">Table of n, a(n) for n = 0..200</a>

%F Coefficient of t^2 in S[n](t) defined in A002464, divided by 2.

%F Recurrence: (n-3)*(n-2)*(n-4)^3*a(n) = (n-3)*(n^4-9*n^3+23*n^2-4*n-29)*(n-4)*a(n-1) - (n-1)*(n^4-12*n^3+57*n^2-125*n+104)*(n-4)*a(n-2) - (n-2)*(n-1)*(n^4-15*n^3+83*n^2-198*n+169)*a(n-3) + (n-3)^3*(n-2)^2*(n-1)*a(n-4). - _Vaclav Kotesovec_, Aug 10 2013

%F a(n) ~ sqrt(2*Pi)*n^(n+1/2)/exp(n+2). - _Vaclav Kotesovec_, Aug 10 2013

%p S:= proc(n) option remember; `if`(n<4, [1, 1, 2*t, 4*t+2*t^2]

%p [n+1], expand((n+1-t)*S(n-1) -(1-t)*(n-2+3*t)*S(n-2)

%p -(1-t)^2*(n-5+t)*S(n-3) +(1-t)^3*(n-3)*S(n-4)))

%p end:

%p a:= n-> ceil(coeff(S(n), t, 2)/2):

%p seq(a(n), n=0..25); # _Alois P. Heinz_, Jan 11 2013

%t S[n_] := S[n] = If[n<4, {1, 1, 2*t, 4*t+2*t^2}[[n+1]], Expand[(n+1-t)*S[n-1]-(1-t)*(n-2+3*t)*S[n-2]-(1-t)^2*(n-5+t)*S[n-3]+(1-t)^3*(n-3)*S[n-4]]]; a[n_] := Ceiling[Coefficient[S[n], t, 2]/2]; Table[a[n], {n, 0, 25}] (* _Jean-François Alcover_, Mar 11 2014, after _Alois P. Heinz_ *)

%Y Cf. A002464, A000130, A086852. Equals A086853/2. A diagonal of A010028.

%K nonn

%O 0,5

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 16:16 EDT 2024. Contains 372387 sequences. (Running on oeis4.)