Triangle read by rows: T(n,k) is the number of permutations of [n] having k cycles with at least 3 alternating runs (it is assumed that the smallest element of a cycle is in the first position), 0<=k<=floor(n/4).

A187250

Triangle read by rows: T(n,k) is the number of permutations of [n] having k cycles with at least 3 alternating runs (it is assumed that the smallest element of a cycle is in the first position), 0<=k<=floor(n/4).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =6a(4) =22a(5) =2a(6) =94a(7) =26a(8) =460a(9) =260a(10) =2532a(11) =2508a(12) =15420a(13) =24760a(14) =140a(15) =102620a(16) =254968a(17) =5292a(18) =739512a(19) =2760432a(20) =128856a(21) =5729192a(22) =31547344a(23) =2640264a(24) =47429896a(25) =381339368a(26) =50186136a(27) =46200a(28) =417429800a(29) =4879612808

External references