Number of pop-stacked permutations

Anders Claesson, Bjarki Ágúst Guðmundsson, Jay Pantone · Harvard Dataverse · 2020

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.

Read the paper · More papers on PaperTik