The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S.

The number of simple reflexive modules in the corresponding Nakayama algebra.

The number of double descents of a permutation. A double descent of a permutation $\pi$ is a position $i$ such that $\pi(i) > \pi(i+1) > \pi(i+2)$.

The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module.

The number of occurrences of the contiguous pattern {{{[.,[.,[.,.]]]}}} in a binary tree. [[oeis:A001006]] counts binary trees avoiding this pattern.

The number of double ascents of a permutation. A double ascent of a permutation $\pi$ is a position $i$ such that $\pi(i) < \pi(i+1) < \pi(i+2)$.

The number of double exceedences of a permutation. A double exceedence is an index $\sigma(i)$ such that $i < \sigma(i) < \sigma(\sigma(i))$.

The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. The top of a module is the cokernel of the inclusion of the radical of the module into the module. For Nakayama algebras with at most 8 simple modules, the statistic also coincides with the number of simple modules with projective dimension at least 3 in the corresponding Nakayama algebra.

The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. For the first 196 values the statistic coincides also with the number of fixed points of $\tau \Omega^2$ composed with its inverse, see theorem 5.8. in the reference for more details. The number of Dyck paths of length n where the statistics returns zero seems to be 2^(n-1).

The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. Let $\nu$ be a (partial) permutation of $[k]$ with $m$ letters together with dashes between some of its letters. An occurrence of $\nu$ in a permutation $\tau$ is a subsequence $\tau_{a_1},\dots,\tau_{a_m}$ such that $a_i + 1 = a_{i+1}$ whenever there is a dash between the $i$-th and the $(i+1)$-st letter of $\nu$, which is order isomorphic to $\nu$. Thus, $\nu$ is a vincular pattern, except that it is not required to be a permutation. An arrow pattern of size $k$ consists of such a generalized vincular pattern $\nu$ and arrows $b_1\to c_1, b_2\to c_2,\dots$, such that precisely the numbers $1,\dots,k$ appear in the vincular pattern and the arrows. Let $\Phi$ be the map [[Mp00087]]. Let $\tau$ be a permutation and $\sigma = \Phi(\tau)$. Then a subsequence $w = (x_{a_1},\dots,x_{a_m})$ of $\tau$ is an occurrence of the arrow pattern if $w$ is an occurrence of $\nu$, for each arrow $b\to c$ we have $\sigma(x_b) = x_c$ and $x_1 < x_2 < \dots < x_k$.