cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1, 2, 4, 36, 1288, 3732552, 13845944773136, 431339599553022278260254864, 184905369551724915055273665254253822188651964997391392
Offset: 1

Views

Author

Amarnath Murthy, Apr 03 2003

Keywords

Crossrefs

Formula

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