8941790domain: NAppears in sequencesTriangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)).at n=39A136394Number of permutations of [n] having exactly three nontrivial cycles.at n=5A289951