This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A122844 Triangle read by rows: T[n,k] = the number of ascending runs of length at least k in the permutations of [n] for k <= n. 2
 1, 3, 1, 12, 5, 1, 60, 28, 7, 1, 360, 180, 50, 9, 1, 2520, 1320, 390, 78, 11, 1, 20160, 10920, 3360, 714, 112, 13, 1, 181440, 100800, 31920, 7056, 1176, 152, 15, 1, 1814400, 1028160, 332640, 75600, 13104, 1800, 198, 17, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Column T[n,1] is essentially A001710 - all ascending runs in permutations of [n] Column T[n,2] is A006157 - ascending runs of length at least 2 in permutations of [n] Column T[n,3] is A005460 - ascending runs of length at least 3 in permutations of [n] LINKS FORMULA T[n,k] = n![k(n-k+1)+1]/(k+1)! for 0

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

Last modified September 20 19:05 EDT 2019. Contains 327246 sequences. (Running on oeis4.)