login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A081976
For n > 2, a(n) is minimal so that the products of two adjacent terms are distinct Fibonacci numbers.
4
1, 2, 4, 36, 1288, 3732552, 13845944773136, 431339599553022278260254864, 184905369551724915055273665254253822188651964997391392
OFFSET
1,2
FORMULA
a(n-1)*a(n) = A079613(n-2) = F(2^(n-2)*3), where F(k) is the k-th Fibonacci number.
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Apr 03 2003
STATUS
approved