Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} for which k is the maximal number of initial odd entries (0 <= k <= ceiling(n/2)).

A152662

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} for which k is the maximal number of initial odd entries (0 <= k <= ceiling(n/2)).

Terms

    a(0) =1a(1) =0a(2) =1a(3) =1a(4) =1a(5) =2a(6) =2a(7) =2a(8) =12a(9) =8a(10) =4a(11) =48a(12) =36a(13) =24a(14) =12a(15) =360a(16) =216a(17) =108a(18) =36a(19) =2160a(20) =1440a(21) =864a(22) =432a(23) =144a(24) =20160a(25) =11520a(26) =5760a(27) =2304a(28) =576a(29) =161280

External references