Related papers: A formula for constructing Mignotte sequences

In this note we provide a simple formula of general term of recurrent sequence.

We present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc). Furthermore, we show that in fact one needs only take the integer closest to…

In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…

In this article we derive a simple twisted relative trace formula.

In this article a new method of generating sums of like powers is presented.

This paper gives a fairly explicit formula for the Hilbert series of algebras of Veronese type.

The purpose of this article is to present my new proof of the the construction and the convergence theorem of spectral sequences of filtered complexes, which is much shorter and cleaner than the "standard" proof.

By using an approach of the invariant theory we obtain a new formula for the ordinary generating function of the numbers of the simple graphs with $n$ nodes.

A new method for continuing the usual Dirichlet series that defines the Riemann zeta function ${\zeta}(s)$ is presented. Numerical experiments demonstrating the computational efficacy of the resulting continuation are discussed.

Studying Fermat sequence we can simply find infinitely many other rapidly growing sequences of similar properties. On the other hand this approach allows us simple construction of such sequences.

We present explicit formulas for the computation of the neighbors of several elements of Farey subsequences.

In this study, we apply the binomial transforms to Tribonacci and Tribonacci-Lucas sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we illustrate the…

We construct all planar semimodular lattices in three simple steps from the direct product of two chains.

In this paper we provide a way to construct new moment sequences from a given moment sequence. An operator based on multivariate positive polynomials is applied to get the new moment sequences. A class of new sequences is corresponding to a…

A construction sequence for a graph is a listing of the elements of the graph (the set of vertices and edges) such that each edge follows both its endpoints. The construction number of the graph is the number of such sequences. We determine…

We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…

Simple constructions are given for finite semifields that include as special cases both old semifields and recently constructed semifields.

We present a new variant of the Faa di Bruno formula with a simpler summation order.

In this article one builds a class of recursive sets, one establishes properties of these sets, and one proposes applications.

The aim of this note is to introduce fastest new general methods for the construction of double and single even order magic squares. As in [5], the method for double even order magic squares is fairly straight-forward but some adjustments…