Related papers: A simplified Binet formula for k-generalized Fibon…
In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime $p$ less than $x$, the basic idea is to fix a constant $q\propto x^{1-\varepsilon}$, pick a uniformly…
In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…
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…
The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined…
We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integer versions of these sequences,…
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…
This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…
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 +…
In this paper, we establish several formulae for sums and alternating sums of products of generalized Fibonacci and Lucas numbers. In particular, we recover and extend all results of Z. Cerin and Z. Cerin & G. M. Gianella, more easily.
In this paper we compute the Frobenius number of certain {\em Fibonacci numerical semigroups}, that is, numerical semigroups generated by a set of Fibonacci numbers, in terms of Fibonacci numbers.
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…
In this study, we apply "r" times the binomial transform to k-Lucas sequence. Also, the Binet formula, summation, generating function of this transform are found using recurrence relation. Finally, we give the properties of iterated…
We derive a formula for the evaluation of weighted generalized Fibonacci sums of the type $S_k^n (w,r) = \sum_{j = 0}^k {w^j j^r G_j{}^n }$. Several explicit evaluations are presented as examples.
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…
This paper proves why the Stirling numbers show up in a experimentally determined formula for the $k$-bonaccis. We develop a bijection between a previously determined summation formula for $k$-bonaccis and an experimentally determined…
In a recent insightful article, Helmut Prodinger uses sophisticated complex analysis, with residues, to derive convolution identities for Fibonacci, Tribonacci, and k-bonacci numbers. Here we use a naive, "experimental mathematics" (yet…
Let $F_{n}$ and $L_n$ be the $n$th Fibonacci and Lucas number, respectively. For each positive integer $m$, the order of appearance of $m$ in the Fibonacci sequence, denoted by $z(m)$, is the smallest positive integer $k$ such that $m$…
We focus on a family of equalities pioneered by Zhang and generalized by Zao and Wang and hence by Mansour which involves self convolution of generalized Fibonacci numbers. We show that all these formulas are nicely stated in only one…
In this paper we state some conjectures about q-Fibonacci polynomials which for q=1 reduce to well-known results about Fibonacci numbers and Fibonacci polynomials.
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…