login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081976 For n>2, a(n) is minimal so that the products of two adjacent terms are distinct Fibonacci numbers. 3
1, 2, 4, 36, 1288, 3732552, 13845944773136, 431339599553022278260254864, 184905369551724915055273665254253822188651964997391392 (list; graph; refs; listen; history; internal format)
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

Cf. A081974, A081975, A079613.

Sequence in context: A182965 A189002 A052716 * A063184 A115250 A018304

Adjacent sequences:  A081973 A081974 A081975 * A081977 A081978 A081979

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 03 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.