|
Search: id:A122844
|
|
|
| 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. |
|
+0
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; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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]
|
|
FORMULA
|
T[n,k] = n![k(n-k+1)+1]/(k+1)! for 0<k<=n; T[n,k] = Sum_{j=k..n}A122843(n,j) (partial row sums of A122843)
|
|
EXAMPLE
|
1
3 1
12 5 1 ; there are 5 ascending runs of length at least 2 in the permutations of [3], namely 13 in 132 and in 213, 23 in 231, 12 in 312, 123 in 123. T[3,2] = 5.
|
|
CROSSREFS
|
Cf. A122844, A001710, A006157, A005460.
Sequence in context: A121420 A117375 A162995 this_sequence A113369 A127894 A127898
Adjacent sequences: A122841 A122842 A122843 this_sequence A122845 A122846 A122847
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
David J. Scambler (dscambler(AT)bmm.com), Sep 13 2006
|
|
|
Search completed in 0.002 seconds
|
