login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A293784
Number of permutations of length n sortable by 6 passes through a pop-stack.
6
1, 1, 2, 6, 24, 120, 720, 5040, 35214, 229378, 1408522, 8370900, 49154431, 288653307, 1703668022, 10115769088, 60332300930, 360602808068, 2156022737216, 12883491408374, 76929443106701, 459100718065735, 2739019173150040, 16339850317888878, 97481064340012333
OFFSET
0,3
LINKS
Bjarki Ágúst Guðmundsson, Table of n, a(n) for n = 0..1000
Anders Claesson, Bjarki Ágúst Guðmundsson, Enumerating permutations sortable by k passes through a pop-stack, arXiv:1710.04978 [math.CO], 2017.
Bjarki Ágúst Guðmundsson, generating function.
Bjarki Ágúst Guðmundsson, PARI script.
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved