Number of pop-stacked permutations
收藏官方服务：
资源简介：
The number of pop-stacked permutations of [n] for n = 1 to 1000 (sequence A307030 in the OEIS) as well as a triangle of numbers giving the number of pop-stacked permutations of each length grouped by number of ascending runs up to n = 300.
创建时间：
2020-01-01
