I got puzzled trying to convert this particular recursive sequence to a general term of a sequence.
$$S_n=1+n+\sum_{j=2}^{n-1} j\times S_{n-j}\times\binom{n}{j}$$
Can somebody help me to reduce to the form of a sequence of $S_n$ that doesn't rely on previous terms?
Thank you very much!