The number of parking functions that give the same permutation.
A parking function $(a_1,\dots,a_n)$ is a list of preferred parking spots of $n$ cars entering a one-way street. Once the cars have parked, the order of the cars gives a permutation of $\{1,\dots,n\}$. This statistic records the number of parking functions that yield the same permutation of cars.

Return a binary tree of size $n-1$ (where $n$ is the size of an ordered tree $t$) obtained from $t$ by the following recursive rule:
- if $x$ is the right brother of $y$ in $t$, then $x$ becomes the right child of $y$;
- if $x$ is the first child of $y$ in $t$, then $x$ becomes the left child of $y$,
and removing the root of $t$.

Return a 312-avoiding permutation corresponding to a binary tree.
The linear extensions of a binary tree form an interval of the weak order called the Sylvester class of the tree. This permutation is the minimal element of this Sylvester class.

Sends a permutation to its reverse.
The reverse of a permutation $\sigma$ of length $n$ is given by $\tau$ with $\tau(i) = \sigma(n+1-i)$.