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.
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.
Terms
- a(0) =1a(1) =3a(2) =1a(3) =12a(4) =5a(5) =1a(6) =60a(7) =28a(8) =7a(9) =1a(10) =360a(11) =180a(12) =50a(13) =9a(14) =1a(15) =2520a(16) =1320a(17) =390a(18) =78a(19) =11a(20) =1a(21) =20160a(22) =10920a(23) =3360a(24) =714a(25) =112a(26) =13a(27) =1a(28) =181440a(29) =100800
External references
- oeis: A122844