- Let $a(n)$ be A112487 i.e. an integer sequence with exponential generating function $$ A(x)=\exp\left(\int (A(x)+A(x)^2)\,dx\right), \\ A(0)=1 $$ However, the definition in the name of the sequence is $$ a(n)=\sum\limits_{k=0}^{n}E_2(n,k)2^k $$ where $E_2(n,k)$ is A340556, the second-order Eulerian numbers with the following recurrence: $$ E_2(n, k) = kE_2(n-1, k) + (2n-k)E_2(n-1, k-1), \\ E_2(0,0) = 1 $$
- Let $b(n)$ be an integer sequence with generating function $\frac{1}{G(0)}$ where $$ G(j)=\cfrac{1-\cfrac{(j+1)x}{G(j+1)}}{1+\cfrac{(j+1)x}{G(j+1)}} $$ Here $G(0)$ is something which might be called multi-continued fraction.
I conjecture that $$a(n)=b(n).$$
Here is the PARI/GP prog to check it numerically:
a(n)=local(A=1+x); for(i=1, n, A=exp(intformal(A+A^2)+x*O(x^n))); n!*polcoeff(A, n)
b(n)=local(CF=1+x*O(x)); for(j=0, n, CF=(1 - (n-j+1)*x/CF)/(1 + (n-j+1)*x/CF)); polcoeff(1/CF, n, x);
test(n)=a(n)==b(n)
Is there a way to prove it?