57897

Appears in sequences

• Irregular triangle read by rows: T(n,k) is the number of n-permutations whose third-longest cycle has length exactly k; n >= 0, 0 <= k <= floor(n/3).at n=20A350015
• Total number of increasing runs in all heapable permutations of length n.at n=8A389256