272198

Appears in sequences

• Number of permutations of size n that require exactly n-1 iterations of the pop-stack sorting map to reach the identity.at n=9A348905
• Triangle read by rows: T(n, k) is the number of permutations of size n that require exactly k iterations of the pop-stack sorting map to reach the identity, for n >= 1, 0 <= k <= n-1.at n=54A359413