cp's OEIS Frontend

A186769 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k nonincreasing even cycles (0<=k<=floor(n/4)). 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 (1528)(347)(6) has 1 nonincreasing even cycles.