A081976 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A081976

For n > 2, a(n) is minimal so that the products of two adjacent terms are distinct Fibonacci numbers.

%I #5 Nov 19 2017 01:39:48

%S 1,2,4,36,1288,3732552,13845944773136,431339599553022278260254864,

%T 184905369551724915055273665254253822188651964997391392

%N For n > 2, a(n) is minimal so that the products of two adjacent terms are distinct Fibonacci numbers.

%F a(n-1)*a(n) = A079613(n-2) = F(2^(n-2)*3), where F(k) is the k-th Fibonacci number.

%Y Cf. A081974, A081975, A079613.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Apr 03 2003