All Questions
6 questions
16
votes
2
answers
1k
views
are these polynomials or rationals functions?
Let $x$ be a variable. Define the following family of sequences (reminiscent of Lucas polynomials) according to the rule: $P_0(x):=0, P_1(x):=1$ and for $n\geq2$ by
$$P_n(x)=xP_{n-1}(x)-P_{n-2}(x).$$
...
9
votes
2
answers
546
views
Can you tie up these Laurent sequences?
Fix an integer $k\geq3$. Define the two families of sequences $\{x_n\}$ and $\{y_n\}$ according to the rules:
$$x_n=\frac{x_{n-1}^2+x_{n-2}^2+\cdots+x_{n-k+1}^2}{x_{n-k}} \qquad n\geq k$$
and
$$y_n=\...
5
votes
1
answer
345
views
Why does this "factorial sequence" appear in the OEIS?
For a reciprocal of a polynomial, $f = \frac{1}{p}$, we (presumably) may construct a sequence $(c_n)_{n=0}^\infty$ such that for all $N\ge 0$
$$f(k)k! = \sum_{n=0}^{N-1} c_n(k-n)! + O((k-N)!). $$
I ...
5
votes
0
answers
183
views
On the polynomials $\sum_{k=0}^n\binom{n+k}k^m q^k$
A sequence of polynomials
$$P_0(q),\ P_1(q),\ P_2(q),\ \ldots$$
with real coefficients is called $q$-log-convex if for each $n=1,2,3,\ldots$ every coefficient of the polynomial $P_{n+1}(q)P_{n-1}(q)-...
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 -\...
2
votes
2
answers
210
views
An identity for the ratio of two partial Bell polynomials
Let $B_{\ell,m}(x_1,x_2,\dotsc,x_{\ell-m+1})$ denote the Bell polynomials of the second kind (or say, partial Bell polynomials, (exponential) partial Bell partition polynomials). I knew that
the ...