相关论文: On Calculating the Coefficients of a Polynomial Ge…
The well-known Worpitzky identity provides a connection between two bases of $\mathbb{Q}[x]$: The standard basis $(x+1)^n$ and the binomial basis ${{x+n-i} \choose {n}}$, where the Eulerian numbers for the Coxeter group of type $A$ (the…
The purpose of this note is twofold: firstly to characterize all the sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ such that $$ \frac{\triangle}{{\bf \triangle} x(s-1/2)}P_{n+1}(x(s-1/2))=c_n(\triangle +2\,\mathrm{I})P_n(x(s-1/2)),…
Recently Kauers, Koutschan and Spahn announced a significant increase in the length of the so-called {\em gerrymander sequence}, given as A348456 in the OEIS, extending the sequence from 3 terms to 7 terms. We give a further extension to 11…
The trinomial transform of a sequence is a generalization of the well-known binomial transform, replacing binomial coefficients with trinomial coefficients. We examine Pascal-like triangles under trinomial transform, focusing on the ternary…
A structured approach for the Collatz conjecture is presented using just the odd integers that are, in turn, divided into categories based on the roles they play such as Starter, Intermediary and Terminal. The expression 4x+1 is used as a…
We give an easy algorithm which calculates the generating function of the cocharacter sequence of the T-ideal of the polynomial identities of the algebra of upper triangular matrices over a field of characteristic zero. Applying this…
Hermann Minkowski introduced a function in 1904 which maps quadratic irrational numbers to rational numbers and this function is now known as Minkowski's question mark function since Minkowski used the notation $?(x)$. This function is a…
We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
Orthogonal polynomials satisfy a recurrence relation of order two, where appear two coefficients. If we modify one of these coefficients at a certain order, we obtain a perturbed orthogonal sequence. In this work we consider in this way…
A large-scale experiment was conducted to find formulas relating to the base $e^\pi$. The numbers in this base are $$x = \sum_{n=0}^\infty {a(n)\over e^{\pi n}}$$ where $a(n)$ is taken from the OEIS catalog. These experiments were inspired…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
$a_n=[x^n](1-x)^{-n}(1-x^2)^{-n}$ is the sequence A348410 in the Encyclopedia of Integer Sequences. Using a method from Hautus and Klarner from 1971 and the software \textsf{Gfun} we find an algebraic equation for the generating function…
If the product of two monic polynomials with real nonnegative coefficients has all coefficients equal to 0 or 1, does it follow that all the coefficients of the two factors are also equal to 0 or 1? Here is an equivalent formulation of this…
We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation…
We use the automatic theorem prover Walnut to resolve various open problems from the OEIS and beyond. Specifically, we clarify the structure of sequence A260311, which concerns runs of sums of upper Wythoff numbers. We extend a result of…
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…
Given a way to evaluate an unknown polynomial with integer coefficients, we present new algorithms to recover its nonzero coefficients and corresponding exponents. As an application, we adapt this interpolation algorithm to the problem of…
In this manuscript, we introduce (symmetric) Tetranacci polynomials $\xi_j$ as a twofold generalization of ordinary Tetranacci numbers, by considering both non unity coefficients and generic initial values in their recursive definition. The…
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…