The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. This n-fold tensor product seems to be always injective.

The number of stack-sorts needed to sort a permutation. A permutation is (West) $t$-stack sortable if it is sortable using $t$ stacks in series. Let $W_t(n,k)$ be the number of permutations of size $n$ with $k$ descents which are $t$-stack sortable. Then the polynomials $W_{n,t}(x) = \sum_{k=0}^n W_t(n,k)x^k$ are symmetric and unimodal. We have $W_{n,1}(x) = A_n(x)$, the Eulerian polynomials. One can show that $W_{n,1}(x)$ and $W_{n,2}(x)$ are real-rooted. Precisely the permutations that avoid the pattern $231$ have statistic at most $1$, see [3]. These are counted by $\frac{1}{n+1}\binom{2n}{n}$ ([[OEIS:A000108]]). Precisely the permutations that avoid the pattern $2341$ and the barred pattern $3\bar 5241$ have statistic at most $2$, see [4]. These are counted by $\frac{2(3n)!}{(n+1)!(2n+1)!}$ ([[OEIS:A000139]]).

The number of cycles in the breakpoint graph of a permutation. The breakpoint graph of a permutation $\pi_1,\dots,\pi_n$ is the directed, bicoloured graph with vertices $0,\dots,n$, a grey edge from $i$ to $i+1$ and a black edge from $\pi_i$ to $\pi_{i-1}$ for $0\leq i\leq n$, all indices taken modulo $n+1$. This graph decomposes into alternating cycles, which this statistic counts. The distribution of this statistic on permutations of $n-1$ is, according to [cor.1, 5] and [eq.6, 6], given by $$ \frac{1}{n(n+1)}((q+n)_{n+1}-(q)_{n+1}), $$ where $(x)_n=x(x-1)\dots(x-n+1)$.

The number of fixed points of a permutation.

The number of occurrences of the pattern 23-1. See [[Permutations/#Pattern-avoiding_permutations]] for the definition of the pattern $23\!\!-\!\!1$.

The number of 2-excedences of a permutation. This is the number of positions $1\leq i\leq n$ such that $\sigma(i)=i+2$.