Recently, the second-order Eulerian polynomials $ \left\langle\!\left\langle x \right\rangle\!\right\rangle_n $ have been discussed on MSE [ a , b ].
$$ \left\langle\!\left\langle x \right\rangle\!\right\rangle_n = \sum_{k=0}^n \left\langle\!\!\left\langle n\atop k \right\rangle\!\!\right\rangle \, x^k $$
Here $\left\langle\!\!\left\langle n\atop k \right\rangle\!\!\right\rangle $ are the second-order Eulerian numbers A340556. The values of these polynomials at $ x = \frac{1}{2} $ generate a sequence that represents the solution of Schröder's fourth problem (see MSE and A000311).
That's a pretty nice result that suggests the question: Do the values of the polynomials at $ x = -\frac{1}{2}$ (times $ 2^n $) also have a combinatorial meaning? That this might indeed be the case is a conjecture suggested by many examples of combinatorial polynomials. The reader can get an impression for himself while browsing through the OEIS.
| Polynomials | P(x) | 2^nP(1/2) | 2^nP(-1/2) |
|---|---|---|---|
| Laguerre | A021009 | A103194 | A000262 |
| Motzkin | A064189 | A330796 | A000244 |
| BigSchröder | A080247 | A065096 | A239204 |
| StirlingSet | A048993 | A005493 | A000110 |
| StirlingCycle | A132393 | A000254 | A000774 |
| Eulerian 1st | A173018 | A180119 | A001710 |
However, this question may not be easy to answer, so we ask a more concrete question. The sequence $ 2^n \left\langle \!\left\langle - 1/2 \right\rangle \!\right\rangle_n $ can also be generated without reference to the second-order Eulerian polynomials by series reversion.
$$ 2^n \left\langle\!\!\left\langle - \frac{1}{2} \right\rangle\!\!\right\rangle_n = (n + 1)!\, [x^{n+1}]\, \text{Reversion}\left(\frac{6x + \exp(3x) - 1}{9}\right) \quad (n \ge 0). $$
Can someone confirm this equation?
Addendum:
The general form of the reversion is described by: $$ \left\langle\! \left\langle x \right\rangle\! \right\rangle_n = (n+1)!\, (1-t)^{2n + 1}\, [x^{n+1}]\, \operatorname{Reversion}_{x}(x + t - t \exp(x)) \quad (n \ge 0) $$