Skip to main content
more informative title
Link
Carlo Beenakker
  • 188.2k
  • 18
  • 448
  • 651

I am having trouble expressing this sequence as Closed form expression for a function of nrecursion relation with binomial coefficients

Source Link

I am having trouble expressing this sequence as a function of n

I am interested in the following sequence: $$ T_n = \sum\limits^{n-1}_{k=0} \begin{pmatrix} n \\ k \end{pmatrix} T_{k}, \ \ \ \ T_0 = C \in \mathbb{N} $$ I would like to express it as a function of n, but none of the method I have tried work.

Asymptotically, I can tell that $T_n = \mathcal{O}(2^{\frac{k^2}{2}})$. One method that failed was to see $T_n$ as the $n$-th term in a series, but those terms grow to fast for it to work.

Do you know how to solve it, or have an intuition regarding how it might get solved?

Thank you.