The product of the hook lengths of the diagonal cells in an integer partition.
For a cell in the Ferrers diagram of a partition, the hook length is given by the number of boxes to its right plus the number of boxes below + 1. This statistic is the product of the hook lengths of the diagonal cells $(i,i)$ of a partition.

Sends an integer partition to the standard tableau obtained by filling the numbers $1$ through $n$ row by row.

Return the permutation obtained by reading the entries of the tableau row by row, starting with the bottom-most row in English notation.

The Lewis-Lyu-Pylyavskyy-Sen shape of a permutation.
An ascent in a sequence $u = (u_1, u_2, \ldots)$ is an index $i$ such that $u_i < u_{i+1}$. Let $\mathrm{asc}(u)$ denote the number of ascents of $u$, and let
$$\mathrm{asc}^{*}(u) := \begin{cases} 0 &\textrm{if u is empty}, \\ 1 + \mathrm{asc}(u) &\textrm{otherwise}.\end{cases}$$
Given a permutation $w$ in the symmetric group $\mathfrak{S}_n$, define
$A'_k := \max_{u_1, \ldots, u_k} (\mathrm{asc}^{*}(u_1) + \cdots + \mathrm{asc}^{*}(u_k))$
where the maximum is taken over disjoint subsequences ${u_i}$ of $w$.
Then $A'_1, A'_2-A'_1, A'_3-A'_2,\dots$ is a partition of $n$. Its conjugate is the Lewis-Lyu-Pylyavskyy-Sen shape of a permutation.