Related papers: Generalized Fibonacci Numbers and Blackwell's Rene…

The close relationship among the polynomial functions and Fibonacci numerical sequences is shown in this paper. These numerical sequences are defined by the recurrence equation $x_{k + n} = \displaystyle\sum_{j = 0}^{n-1}\alpha_j x_{k +…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

In this paper, new families of generalized Fibonacci and Lucas numbers are introduced. In addition, we present the recurrence relations and the generating functions of the new families for $k=2$.

We give a survey of a number of simple applications of renewal theory to problems on random strings and tries: insertion depth, size, insertion mode and imbalance of tries; variations for b-tries and Patricia tries; Khodak and Tunstall…

An elementary renewal theorem and a Blackwell theorem provided by Jasiulis-Go{\l}dyn et al. (2020) in a setting of Kendall convolutions are proved under weaker hypothesis and extended to the Gamma class. Convergence rates of the limits…

Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with…

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 derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

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…

We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…

For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined by the initial values $0,0,...,0,1$ ($k$ terms) and such that each term afterwards is the sum of the $k$ preceding terms. In 2005, Noe and Post conjectured…

In this paper, we present a new generalization of the Lucas numbers by matrix representation using Genaralized Lucas Polynomials. We give some properties of this new generalization and some relations between the generalized order-k Lucas…

Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…

In this paper we investigate the normal and the large fluctuations of additive functionals associated with a stochastic process under a general non-Poissonian resetting mechanism. Cumulative functionals of regenerative processes are very…

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…

We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences sharing similar recursive identities. Restricting to the…

In part 1 of this paper some linear weighted generalized Fibonacci number summation identities were derived using the fact that the Fibonacci number is the residue of a rational function. In this part, using the same method, some quadratic…

We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the…

We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…

The main purpose of this paper is to construct not only generating functions of the new approach Genocchi type numbers and polynomials but also interpolation function of these numbers and polynomials which are related to a, b, c arbitrary…