The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A152883 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} in which k is an excedance (n >= 2, 1 <= k <= n-1). An excedance of a permutation p is a value j such that p(j) > j. 2
1, 4, 2, 18, 12, 6, 96, 72, 48, 24, 600, 480, 360, 240, 120, 4320, 3600, 2880, 2160, 1440, 720, 35280, 30240, 25200, 20160, 15120, 10080, 5040, 322560, 282240, 241920, 201600, 161280, 120960, 80640, 40320, 3265920, 2903040, 2540160, 2177280, 1814400, 1451520, 1088640, 725760, 362880 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
2,2
COMMENTS
Sum of entries in row n = n!*(n-1)/2 = A001286(n) (the Lah numbers).
T(n,n-1) = (n-1)! (A000142).
LINKS
FORMULA
T(n,k) = (n-1)!*(n-k) (n >= 2, 1 <= k <= n-1). [Proof: n-k choices for p(k) and (n-1)! choices for the remaining entries of p.]
EXAMPLE
T(4,3) = 6 because the permutations of {1,2,3,4} in which 3 is an excedance are 1243, 1342, 3142, 2143, 2341 and 3241.
Triangle starts:
1;
4, 2;
18, 12, 6;
96, 72, 48, 24;
600, 480, 360, 240, 120;
MAPLE
T := proc (n, k) options operator, arrow: factorial(n-1)*(n-k) end proc: for n from 2 to 10 do seq(T(n, k), k = 1 .. n-1) end do;
CROSSREFS
Sequence in context: A303243 A074676 A257505 * A285793 A117692 A052966
KEYWORD
nonn,tabl
AUTHOR
Emeric Deutsch, Jan 13 2009
STATUS
approved

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 12 22:02 EDT 2024. Contains 372495 sequences. (Running on oeis4.)