Advanced Search

We consider the Tribonacci sequence $T:={T_n}_{n\ge 0}$ given by T₀ = 0, T₁ = T₂ = 1 and $T_{n+3}=T_{n+2}+T_{n+1}+T_n$ for all n ≥ 0, and we find all triples of Tribonacci numbers which are multiplicatively dependent.

A generalization of the well-known Fibonacci sequence ${Fₙ}_{n\ge 0}$ given by F₀ = 0, F₁ = 1 and $F_{n+2}=F_{n+1}+Fₙ$ for all n ≥ 0 is the k-generalized Fibonacci sequence ${F{ₙ}^{\left(k\right)}}_{n\ge -(k-2)}$ whose first k terms are 0,..., 0, 1 and each term afterwards is the sum of the preceding k terms. For the Fibonacci sequence the formula $Fₙ²+F{²}_{n+1}²=F_{2n+1}$ holds for all n ≥ 0. In this paper, we show that there is no integer x ≥ 2 such that the sum of the xth powers of two consecutive k-generalized Fibonacci numbers is again a k-generalized Fibonacci number. This generalizes...