加载中…
We discuss the integer sequence transform where is the number of real roots of the polynomial . It is shown that several sequences give the trivial sequence $b = (0,1,0,1, 0,1,\ldots){b_n = n \bmod 2}$, among them the Catalan numbers, central binomial coefficients, and for a fixed . We also look at some sequences for which is more interesting such as $a_n = (n+1)^kk \geq 3$. Further, general procedures are given for constructing real sequences for which is either always maximal or minimal.

生成讲解博客的中文版本

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