Related papers: A note on closed-form representation of Fibonacci …
We present an elementary proof of the generalization of the $k$-bonacci Binet formula, a closed form calculation of the $k$-bonacci numbers using the roots of the characteristic polynomial of the $k$-bonacci recursion.
We present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc). Furthermore, we show that in fact one needs only take the integer closest to…
We give a survey of some known and some new results about factors of different sorts of $q-$Fibonacci numbers.
The notion of 'bifurcating continued fractions' is introduced. Two coupled sequences of non-negative integers are obtained from an ordered pair of positive real numbers in a manner that generalizes the notion of continued fractions. These…
We consider the structure of a variation of the Fibonacci sequence which is determined by a Bernoulli process. The associated structure of all Bernoulli variations of the Fibonacci sequence can be represented by a directed binary tree,…
We reduce the calculation of the simplest Hodge integrals to some sums over decorated trees. Since Hodge integrals are already calculated, this gives a proof of a rather interesting combinatorial theorem and a new representation of…
In this first paper, we look at the following question: are the properties of the Fibonacci tree still true if we consider a finitely generated tree by the same rules but rooted at a black node? The direct answer is no, but new properties…
In a base phi representation a natural number is written as a sum of powers of the golden mean $\varphi$. There are many ways to do this. How many? Even if the number of powers of $\varphi$ is finite, then any number has infinitely many…
We study $B(n;k)$, the number of ways of writing $n$ as a sum or difference of the first $k$ Fibonacci numbers. We show that $B(0;k)$ satisfies the Tribonacci-like recurrence $B(0;k+1)=B(0;k)+B(0;k-1)+B(0;k-2)$ and that $B(n;k)$ satisfies a…
In this study, we apply the binomial transforms to Tribonacci and Tribonacci-Lucas sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we illustrate the…
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…
Let $\alpha = (1+\sqrt{5})/2$ and define the lower and upper Wythoff sequences by $a_i = \lfloor i \alpha \rfloor$, $b_i = \lfloor i \alpha^2 \rfloor$ for $i \geq 1$. In a recent interesting paper, Kawsumarng et al. proved a number of…
Place value numbers, such as the binary or decimal numbers can be represented by the end vertices (leaf or pendant vertices) of rooted symmetrical trees. Numbers that consist of at most a fixed number of digits are represented by vertices…
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robustness and compression capability. Asymptotically, these codes provide better compression efficiency as the order of the underlying Fibonacci…
Phylogenetic trees are used to model evolution: leaves are labelled to represent contemporary species ("taxa") and interior vertices represent extinct ancestors. Informally, convex characters are measurements on the contemporary species in…
Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…
In this paper we introduce a family of partitions of the set of natural numbers, Fibonacci-like partitions. In particular, we introduce a Fibonacci-like partition in a number of parts corresponding to the Fibonacci numbers, the standard…
We look at a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this…
Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.
We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…