We consider the Tribonacci sequence T:=ₙ≥ 0 given by T₀ = 0, T₁=T₂=1 and Tₙ₊₃=Tₙ₊₂+Tₙ₊₁+Tₙ for all n≥ 0, and we find all triples of Tribonacci numbers which are multiplicatively dependent.
No takes yet. Share an insight, caveat, or question.
Gómez et al. (2015) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: