686789427domain: NAppears in sequencesProducts of distinct terms of A001566: a(n) = Product_{i=0..floor(log_2(n+1))} L(2^(i+1))^bit(n,i).at n=21A050614a(0)=a(1)=1, a(n) = least k > a(n-1) such that k*a(n-2) is a Fibonacci number.at n=11A214914