Related papers: On Horadam-Lucas sequence
The main object of this paper is to investigate a new class of the generalized Hurwitz type poly-Bernoulli numbers and polynomials from which we derive some algorithms for evaluating the Hurwitz type poly-Bernoulli numbers and polynomials.…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
We present a range of difficult integration formulas involving Fibonacci and Lucas numbers and trigonometric functions. These formulas are often expressed in terms of special functions like the dilogarithm and Clausen's function. We also…
In these notes we address the study of the log-concave operator acting on Lucas Sequences of first kind. We will find for which initial values a generic Lucas sequence is log-concave, and using this we show when the same sequence is…
In this paper we present two families of Fibonacci-Lucas identities, with the Sury's identity being the best known representative of one of the families. While these results can be proved by means of the basic identity relating Fibonacci…
The Lucas polynomials, $\{n\}$, are polynomials in $s$ and $t$ given by $\{ n \} = s \{ n-1 \} + t \{ n-2 \}$ for $n \geq 2$ with $ \{ 0 \} = 0$ and $\{ 1 \} = 1$. The lucanomial coefficients, an analogue of the binomial coefficients, are…
This contribution presents all possible solutions to the Diophantine equations $F_k=L_mL_n$ and $L_k=F_mF_n$. To be clear, Fibonacci numbers that are the product of two arbitrary Lucas numbers and Lucas numbers that are the product of two…
The research aims to construct a new type of matrix called the Fibonacci-Hessenberg-Lorentz matrix by multiplying Fibonacci-Hessenberg matrices with Lorentz matrix multiplication. The study will start by examining the properties of…
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…
The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…
Let $V_{n}$ denote the third order linear recursive sequence defined by the initial values $V_{0}$, $V_{1}$ and $V_{2}$ and the recursion $V_{n}=rV_{n-1}+sV_{n-2}+tV_{n-3}$ if $n\geq 3$, where $r$, $s$, and $t$ are real constants. The…
We derive an identity involving Horadam numbers. Numerous new identities as well as those found in the existing literature are subsumed in this single identity.
The classical Ulam sequence is defined recursively as follows: $a_1=1$, $a_2=2$, and $a_n$, for $n > 2$, is the smallest integer not already in the sequence that can be written uniquely as the sum of two distinct earlier terms. This…
In this paper we study how to accelerate the convergence of the ratios (x_n) of generalized Fibonacci sequences. In particular, we provide recurrent formulas in order to generate subsequences (x_{g_n}) for every linear recurrent sequence…
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…
It is shown how some of the recent results of de Souza et al. [1] can be generalized to describe Hamiltonians whose eigenvalues are given as k-generalized Fibonacci numbers. Here k is an arbitrary integer and the cases considered by de…
In this study, we introduce the generalized Gaussian third-order Jacobsthal numbers with arbitrary initial values and discuss two particular cases, namely, Gaussian third-order Jacobsthal and Gaussian modified third-order Jacobsthal…
We investigate the arithmetic nature of P-recursive sequences through the lens of their D-finite generating functions. Building on classical tools from differential algebra, we revisit the integrality criterion for Motzkin-type sequences…
By Zeckendorf's theorem, an equivalent definition of the Fibonacci sequence (appropriately normalized) is that it is the unique sequence of increasing integers such that every positive number can be written uniquely as a sum of non-adjacent…
The following article summarizes research where theorems and their respective demonstrations are postulated based on quadratic equations with special properties given by the Pythagorean triplets and the Fibonacci sequence given the second…