cp's OEIS Frontend

A186764 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing even cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) . A cycle is said to be even if it has an even number of entries. For example, the permutation (18)(2347)(569) has 2 increasing even cycles.