Related papers: Fibonacci Numbers and Their Lucas Coefficients

We study sums of powers of Fibonacci and Lucas polynomials of the form $% \sum_{n=0}^{q}F_{tsn}^{k}(x) $ and $\sum_{n=0}^{q}L_{tsn}^{k}% (x) $, where $s,t,k$ are given natural numbers, together with the corresponding alternating sums…

We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.

Consider the positive integers $n$ such that $n$ divides the $n$-th Fibonacci number, and their counting function $A$. We prove that \[A(x) \leq x^{1-(1/2+o(1))\log\log\log x/\log\log x}.\]

Let us denote by $F_n$ the $n$-th Fibonacci number. In this paper we show that for a fixed integer $y$ there exists at most one integer exponent $a>0$ such that the Diophantine equation $F_n+F_m=y^a$ has a solution $(n,m,a)$ in positive…

In this article, we consider the Diophantine equation $\sigma_{2}(n)-n^2=An+B$ with $A=P^2\pm2$. For some $B$, we show that except for finitely many computable solutions in the range $n\leq(|A|+|B|)^{3}$, all the solutions are expressible…

In these notes we study the $k$-generalized Fibonacci sequences - $(F_n^{(k)})_{n\in \Z}$ - with positive and negative indices. Denote $T_k(x)$ its characteristic polynomial. Our most interesting finding is that if $k$ is even then the…

The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers…

Both Fibonacci and Lucas numbers can be described combinatorially in terms of 0-1 strings without consecutive ones. In the present article we explore the occupation numbers as well as the correlations between various positions in the…

Recently, Chu studied some properties of the partial sums of the sequence $P^k(F_n)$, where $P(F_n)=\big(\sum_{i=1}^nF_i\big)_{n\geq1}$ and $(F_n)_{n\geq1}$ is the Fibonacci sequence, and gave its combinatorial interpretation. We generalize…

In this work, we made a generalization that includes all bicomplex Fibonacci-like numbers such as; Fibonacci, Lucas, Pell, etc.. We named this generalization as bicomplex Horadam numbers. For bicomplex Fibonacci and Lucas numbers we gave…

We consider the tiling of an $n$-board (a board of size $n\times1$) with squares of unit width and $(1,1)$-fence tiles. A $(1,1)$-fence tile is composed of two unit-width square subtiles separated by a gap of unit width. We show that the…

We give an explicit description of the coefficients of the formal power series (1-x)(1-x^2)(1-x^3)(1-x^5)(1-x^8)(1-x^13)... In particular, we show that all the coefficients are equal to -1, 0 or 1.

Let $(U_{n}(P,Q) $ and $(V_{n}(P,Q) $ denote the generalized Fibonacci and Lucas sequence, respectively. In this study, we assume that $Q=1.$ We determine all indices $n$ such that $U_{n}=5\square $ and $U_{n}=5U_{m}\square $ under some…

In this paper, some $k$-Fibonacci and $k$-Lucas with arithmetic indexes sums are derived by using the matrices $R_{a}=\left[ \begin{array}{lr} L_{k,a} & -(-1)^{a} \\ 1 & 0 \end{array}\right]$ and $S_{a}=\frac{1}{2}\left[ \begin{array}{lr}…

We explicitly solve the diophantine equations of the form $$ A_{n_1}A_{n_2}\cdots A_{n_k}\pm 1 = B_m^2 $$ where $(A_n)_{n\geq 0}$ and $(B_m)_{m\geq 0}$ are either the Fibonacci sequence or Lucas sequence. This extends the result of D.…

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…

We consider the tiling of an $n$-board (a $1\times n$ array of square cells of unit width) with half-squares ($\frac12\times1$ tiles) and $(\frac12,\frac12)$-fence tiles. A $(\frac12,\frac12)$-fence tile is composed of two half-squares…

In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let $p$ be an odd prime and let $a$ be a positive integer. We show that if $p\equiv 1\pmod{4}$ or $a>1$ then $$…

For number $n>1$, let $\mathcal{A}(n) = \{1\leq a<n: n|a^2-1, a|n^2-1 \}$. We show that the size of $\mathcal{A}(n)$ is connected to a property concerning integer evaluations of Fibonacci-like polynomials. In the process, we prove that…