Related papers: A formula for constructing Mignotte sequences
An elementary approach to the construction of Coxeter group representations is presented.
In this paper, we find a new recurrence formula fo the Euler zeta functions.
There are several standard procedures used to create new sequences from a given sequence or from a given pair of sequences. In this paper I discuss the most popular of these procedures. For each procedure, I give a definition and provide…
The aim of this note is to introduce a fast new general method for the construction of double and single even order magic squares. The method for double even order magic squares is fairly straight-forward but some adjustment is necessary…
The aim of this short note is to present an elementary, self-contained, and direct proof for the classical Lebesgue decomposition theorem.
We present an explicit formula for Witten-Kontsevich tau-function.
We give an explicit formula for the Hankel transform of a regular sequence in terms of the coefficients of the associated orthogonal polynomials and the sequence itself. We apply this formula to some sequences of combinatorial interest,…
A new set of formulas for primes is presented. These formulas are more efficient and grow much slower than the two known formulas of Mills and Wright. 3 new formulas are explained.
The aim of this paper is to study the characteristics of a general method to produce a new approximation sequence from a given one, by using suitable convex combinations.
In this paper, a computationally simple and explicit method of constructing recursive sequence of primitive polynomials of degree $n2^k (k = 1, 2, 3,\ldots)$ over $\mathbb{F}_{q}$ is given.
We give some results and conjectures about recurrence relations for certain sequences of binomial sums.
We propose a simple model which possesses the chain fountain effect.
This paper is devoted to establishing several new formulas relating Bernoulli and Stirling numbers of both kinds.
In this paper, we investigate new class of sequences related to fully degenerate Bernoulli numbers and polynomials. From those sequences, we derive some formulae for the degenerate Bernoulli and Euler polynomials.
An explicit formula for a strong connection form in a principal extension by a coseparable coalgebra is given.
In this note, we present a simple summation formula for $k$-bonacci numbers. The derivation consists in obtaining the generating function of such numbers, and noting that its evaluation at a particular value yields a formula generalizing a…
The method of constructing trigonometric Hermite splines, which interpolate the values of some periodic function and its derivatives in the nodes of a uniform grid, is considered. The proposed method is based on the periodicity properties…
A recipe is presented for constructing band-limited superoscillating functions that exhibit arbitrarily high frequencies over arbitrarily long intervals.
Modifying an idea of E. Brietzke we give simple proofs for the recurrence relations of some sequences of binomial sums which have previously been obtained by other more complicated methods.
In this short paper, we establish connection formulae for trivariate $q$-polynomials.