3732552domain: NAppears in sequencesFor n > 2, a(n) is minimal so that the products of two adjacent terms are distinct Fibonacci numbers.at n=5A081976a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is a Fibonacci number.at n=10A214914