Return to Question

What is the general method for finding the aymptotics of large $n$ of the sequence $(a_n)_{n=0}^\infty$ defined by the recursion $$a_{n} = (\alpha_1n+\alpha_2) a_{n-1} + (\alpha_3n+\alpha_4) a_{n-2}+\delta \tag1$$ where $\alpha_i$'s are constant real numbers and $\delta\in\{0,1\}$.

Here is an example of the above recursion and my frustrated attempt at using the generating function for the un-simplified version. That particular example is solvable with a generating function once it is transformed. However, not every recursion of the form $(1)$ can be simplified through a simple transformation.

What is the general method for finding the aymptotics of large $n$ of the sequence $(a_n)_{n=0}^\infty$ defined by the recursion $$a_{n} = (\alpha_1n+\alpha_2) a_{n-1} + (\alpha_3n+\alpha_4) a_{n-2}+\delta \tag1$$ where $\alpha_i$'s are constant real numbers and $\delta\in\{0,1\}$ is constant.

Here is an example of the above recursion and my frustrated attempt at using the generating function for the un-simplified version. That particular example is solvable with a generating function once it is transformed. However, not every recursion of the form $(1)$ can be simplified through a simple transformation.

What is the general method for finding the aymptotics of large $n$ of the sequence $(a_n)_{n=0}^\infty$ defined by the recursion $$a_{n} = (\alpha_1n+\alpha_2) a_{n-1} + (\alpha_3n+\alpha_4) a_{n-2}+\delta$$ where $\alpha_i$'s are constant real numbers and $\delta\in\{0,1\}$.

Here is an example of the above recursion and my frustrated attempt at using the generating function.

What is the general method for finding the aymptotics of large $n$ of the sequence $(a_n)_{n=0}^\infty$ defined by the recursion $$a_{n} = (\alpha_1n+\alpha_2) a_{n-1} + (\alpha_3n+\alpha_4) a_{n-2}+\delta \tag1$$ where $\alpha_i$'s are constant real numbers and $\delta\in\{0,1\}$.

Here is an example of the above recursion and my frustrated attempt at using the generating function for the un-simplified version. That particular example is solvable with a generating function once it is transformed. However, not every recursion of the form $(1)$ can be simplified through a simple transformation.

What is the general method for finding the aymptotics of large $n$ of the sequence $(a_n)_{n=0}^\infty$ defined by the recursion $$a_{n} = (\alpha_1n+\alpha_2) a_{n-1} + (\alpha_3n+\alpha_4) a_{n-2}+\delta$$ where $\alpha_i$'s are constant real numbers and $\delta\in\{0,1\}$.

What is the general method for finding the aymptotics of large $n$ of the sequence $(a_n)_{n=0}^\infty$ defined by the recursion $$a_{n} = (\alpha_1n+\alpha_2) a_{n-1} + (\alpha_3n+\alpha_4) a_{n-2}+\delta$$ where $\alpha_i$'s are constant real numbers and $\delta\in\{0,1\}$.

Here is an example of the above recursion and my frustrated attempt at using the generating function.