Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k maximal strings of increasing consecutive integers (0<=k<=floor(n/2)).

A136123

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k maximal strings of increasing consecutive integers (0<=k<=floor(n/2)).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =3a(6) =11a(7) =12a(8) =1a(9) =53a(10) =56a(11) =11a(12) =309a(13) =321a(14) =87a(15) =3a(16) =2119a(17) =2175a(18) =693a(19) =53a(20) =16687a(21) =17008a(22) =5934a(23) =680a(24) =11a(25) =148329a(26) =150504a(27) =55674a(28) =8064a(29) =309

External references