cp's OEIS Frontend

A186766 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k nonincreasing odd cycles (0<=k<=floor(n/3)). 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 odd if it has an odd number of entries. For example, the permutation (152)(347)(6)(8) has 1 nonincreasing odd cycle.