cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A348905 Number of permutations of size n that require exactly n-1 iterations of the pop-stack sorting map to reach the identity.

Table of values

n a(n)
1 1
2 1
3 2
4 8
5 32
6 155
7 830
8 5106
9 35346
10 272198
11 2344944
12 22070987
13 230156314
14 2590636217
15 31914293380
16 420241717802

List of values

[1, 1, 2, 8, 32, 155, 830, 5106, 35346, 272198, 2344944, 22070987, 230156314, 2590636217, 31914293380, 420241717802]