相关论文: The unifying formula for all Tribonacci-type octon…

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. The main result is twofold: (1) we give the explicit expressions of the numbers of distinct squares and cubes in $\mathbb{T}[1,n]$ (the…

We study generically split octonion algebras over schemes using techniques of ${\mathbb A}^1$-homotopy theory. By combining affine representability results with techniques of obstruction theory, we establish classification results over…

In this paper, we study the theory of the harmonic and the hyperharmonic Fibonacci numbers. Also, we get some combinatoric identities like as harmonic and hyperharmonic numbers and we obtain some useful formulas for $\mathbb{F}_{n}$, which…

We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…

The aim of this paper is to construct general forms of ordinary generating functions for special numbers and polynomials involving Fibonacci type numbers and polynomials, Lucas numbers and polynomials, Chebyshev polynomials, Sextet…

Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson presented a complete solution for the number of…

Sequences of Genocchi numbers of the first and second kind are considered. For these numbers, an approach based on their representation using sequences of polynomials is developed. Based on this approach, for these numbers some identities…

We prove that a Poisson-Newton formula, in a broad sense, is associated to each Dirichlet series with a meromorphic extension to the whole complex plane of finite order. These formulas simultaneously generalize the classical Poisson formula…

We derive a new Fibonacci identity. This single identity subsumes important known identities such as those of Catalan, Ruggles, Halton and others, as well as standard general identities found in the books by Vajda, Koshy and others. We also…

In \cite{Choi-Jo}, the $am+b$ ($0\leq b<a$) subscripted Tribonacci numbers are studied. This work is devoted to study a new generalization of Fibonacci numbers called Padovan numbers. In particular, the $am+b$ subscripted Padovan numbers…

We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…

In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…

By investigating a recurrence relation about functions, we first give alternative proofs of various identities on Fibonacci numbers and Lucas numbers, and then, make certain well known identities visible via certain trivalent graph…

Recently, Kulo\u{g}lu {\it et al.} \cite{Kul} introduced the higher order Horadam numbers. In this study, novel 3-parameter generalized quaternion sequences of higher order Horadam numbers, which have not been studied before, are defined by…

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a)=ab$, $\sigma(b)=ac$, $\sigma(c)=a$. The prefix of $\mathbb{T}$ of length $n$ is denoted by $\mathbb{T}[1,n]$. The main result is threefold, we give: (1)…

In this paper, by using some families of special numbers and polynomials with their generating functions, we give various properties of these numbers and polynomials. These numbers are related to the well-known numbers and polynomials,…

One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…

We consider an identity relating Fibonacci numbers to Pascal's triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, all of them rather involved or else relying on sophisticated number theoretical…

In this paper we introduce the generalization of Multi Poly-Euler polynomials and we investigate some relationship involving Multi Poly-Euler polynomials. Obtaining a closed formula for generalization of Multi Poly-Euler numbers therefore…

In this paper we focus on two new families of polynomials which are connected with exponential polynomials and geometric polynomials. We discuss their generalizations and show that these new families of polynomials and their generalizations…