Related papers: On Generalized Fibonacci Numbers
This paper, in considering aspects of the geometric mean sequence, offers new results connecting generalized Tribonacci and third-order Horadam numbers which are established and then proved independently.
We show that for the classical Fibonacci sequence (Fn) and the Lucas sequence (Ln) the following identity holds for every integer n >= 2: (n-1)Fn equals the sum from k=1 to n-1 of Lk multiplied by F(n-k). Equivalently, this gives a…
We evaluate the nested sum $\sum_{a_{n - 1} = c}^{a_n } {\sum_{a_{n - 2} = c}^{a_{n - 1} } { \cdots \sum_{a_0 = c}^{a_1 } {x^{a_0 } } } }$ where $a_n$ and $c$ are any integers and $x$ is a real or complex variable. Consequently, we evaluate…
We present a variety of numerical data related to the growth of terms in aliquot sequences, iterations of the function $s(n) = \sigma(n) - n$. First, we compute the geometric mean of the ratio $s_k(n)/s_{k-1}(n)$ of $k$th iterates for $n…
This paper builds on the research initiated by Boyadzhiev, but introduces generalized harmonic numbers, \[ H_n(\alpha)= \sum_{k=1}^n \frac{\alpha^{k}}{k}, \] which enable the derivation of new identities as well as the reformulation of…
We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…
Generalized Fibonacci-like sequences appear in finite difference approximations of the Partial Differential Equations based upon replacing partial differential equations by finite difference equations. This paper studies properties of the…
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…
For an integer $k\geq 2$, let $\{F^{(k)}_{n}\}_{n\geqslant 2-k}$ be the $ k$--generalized Fibonacci sequence which starts with $0, \ldots, 0,1$ (a total of $k$ terms) and for which each term afterwards is the sum of the $k$ preceding terms.…
In this study, we present a new generalization of circulant matrices for the generalized $k$-Horadam numbers, by considering the $g$-circulant matrix $C_{n,g}(H)=g -circ(H_{k,1},H_{k,2},\ldots ,H_{k,n})$. Also, we calculate the spectral…
The sequence of partial sums of Fibonacci numbers, beginning with $2$, $4$, $7$, $12$, $20$, $33,\dots$, has several combinatorial interpretations (OEIS A000071). For instance, the $n$-th term in this sequence is the number of length-$n$…
We show that if $k\ge 2$ is an integer and $(F_n^{(k)})_{n\ge 0}$ is the sequence of $k$-generalized Fibonacci numbers, then there are only finitely many triples of positive integers $1<a<b<c$ such that $ab+1,~ac+1,~bc+1$ are all members of…
In this expository paper written to commemorate Fibonacci Day 2016, we discuss famous relations involving the Fibonacci sequence, the golden ratio, continued fractions and nested radicals, and show how these fit into a more general…
In this paper, we define k-generalized order-k numbers and we obtain a relation between i-th sequences and k-th sequences of k-generalized order-k numbers. We give some determinantal and permanental representations of k-generalized order-k…
We study generalizations of the sequence of the n-anacci constants that consist of the ratio limits generated by linear recurrences of an arbitrary order n with equal positive weights p. We derive the analytic representation of these ratio…
We show that the $p$-adic valuation of the sequence of Fibonacci numbers is a $p$-regular sequence for every prime $p$. For $p \neq 2, 5$, we determine that the rank of this sequence is $\alpha(p) + 1$, where $\alpha(m)$ is the restricted…
Two $k$-ary Fibonacci recurrences are $a_k(n) = a_k(n-1) + k \cdot a_k(n-2)$ and $b_k(n) = k \cdot b_k(n-1) + b_k(n-2)$. We provide a simple proof that $a_k(n)$ is the number of $k$-regular words over $[n] = \{1,2,\ldots,n\}$ that avoid…
The recurrence for the $k$-Fibonacci polynomials is usually iterated upwards to positive values of $n$ only. When the recurrence is iterated downwards to $n<0$, there are indices where the polynomials vanish identically. This fact does not…
The sequence $F_{dn+h}$ and its convolutions have (for $h=0$) been studied in a recent paper at the arxiv [arXiv:2603.08636]. The instance with general $h$ is more involved and uses Chebyshev polynomials.
The $d$-Fibonacci digraphs $F(d,k)$, introduced here, have the number of vertices following generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we study some of their…