Consider the convolutional recurrence relation below: $$T(n)=\begin{cases}\displaystyle\sum_{k=1}^{n−1} k\cdot T(k)\cdot T(n−k) & n\ge2\\ 1 &n=1 \end{cases}$$
Does it have a closed form? Or is it possible to get a tight upper bound of $T(n)$?
Consider the convolutional recurrence relation below: $$T(n)=\begin{cases}\displaystyle\sum_{k=1}^{n−1} k\cdot T(k)\cdot T(n−k) & n\ge2\\ 1 &n=1 \end{cases}$$
Does it have a closed form? Or is it possible to get a tight upper bound of $T(n)$?
Copyright © 2021 JogjaFile Inc.