Generalizing some popular sequences like Catalan’s number, Schröder’s number, etc, we consider the sequence with and for , \begin{multline*} s_n=\sum_{x_1+\dots+x_{\ell_1}=n-1} κ_1 s_{x_1}\dots s_{x_{\ell_1}} + \dots +\sum_{x_1+\dots+x_{\ell_{t’}}=n-1} κ_{t’} s_{x_1}\dots s_{x_{\ell_{t’}}}+\ \max_{x_1+\dots+x_{\ell_{t’+1}}=n-1} κ_{t’+1} s_{x_1}\dots s_{x_{\ell_{t’+1}}} + \dots + \max_{x_1+\dots+x_{\ell_t}=n-1} κ_t s_{x_1}\dots s_{x_{\ell_t}}, \end{multline*} where are nonnegative integers, are positive integers, and are positive reals. We show that it is possible to compute the growth rate of to any precision. In particular, for every , where and for some with , and the logarithm has the base . The constants in the inequalities are not very well optimized and serve mostly as a proof of concept with the ratio of the upper bound and the lower bound converging to as goes to infinity.

生成讲解博客的中文版本

生成AI智能校验的中文版本