All Questions
2 questions
5
votes
1
answer
179
views
A common combinatorial description for a certain type of recurrences
For integer-valued sequences $(x_n)_{n=0}^\infty$, consider recurrences of the form
$$x_n=ax_{n-1}+(bn+c)x_{n-2} \tag{$*$}\label{star}$$
for $n\ge2$, where $a,b,c$ are integers.
There seem to be many ...
2
votes
1
answer
196
views
Guess (or upper bound) the general formula for a double sequence
Let $t,s \geq 0$ be integers. We have the following recursive formula:
$$f(t+1,s) = f(t,s) + f(t,s-1) + \sum_{0\leq a,b,c \leq h(t):\\a+b+c = s-1}f(t,a)f(t,b)f(t,c),$$ where
$$h(t) = \frac{1}{2}3^t -\...