Number of permutations of size n that require exactly n-1 iterations of the pop-stack sorting map to reach the identity.
A348905
Number of permutations of size n that require exactly n-1 iterations of the pop-stack sorting map to reach the identity.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =8a(4) =32a(5) =155a(6) =830a(7) =5106a(8) =35346a(9) =272198a(10) =2344944a(11) =22070987a(12) =230156314a(13) =2590636217a(14) =31914293380a(15) =420241717802
External references
- oeis: A348905