科研之友
微信
新浪微博
Facebook
分享链接
摘要
The Tribonacci sequence {T-n}(n >= 0) has initial values T-0 = 0, T-1=T-2=1 and each term afterwards is the sum of the preceding three terms. In this paper, we study sequences a(1), . . ., a(m) of positive integers such that the product of any two different terms is a Tribonacci number. We prove that there is no such example with m = 4, give an example with m = 3, and leave as an open problem to find all examples for m = 3.
- 出版日期2015
