Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081976
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081976 For n>2, a(n) is minimal so that the products of two adjacent terms are distinct Fibonacci numbers. +0
4
1, 2, 4, 36, 1288, 3732552, 13845944773136, 431339599553022278260254864, 184905369551724915055273665254253822188651964997391392 (list; graph; listen)
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: A009090 A009295 A052716 this_sequence A063184 A115250 A018304

Adjacent sequences: A081973 A081974 A081975 this_sequence A081977 A081978 A081979

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 8 08:06 EDT 2008. Contains 143486 sequences.


AT&T Labs Research