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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182602 Smallest Fibonacci number in a sequence of at least n consecutive composite Fibonacci numbers. 1
8, 21, 21, 2584, 2584, 832040, 832040, 832040, 832040, 832040, 832040, 832040, 832040, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..24.

FORMULA

a(n) = A000045(A182601).

a(n) = min{ A000045(i): A000045(j) in A002808 for all j=i..i+n-1}.

EXAMPLE

a(2) = a(3) = 21 because (21, 34, 55) is a run of three consecutive Fibonacci composites, so 21 is in the sequence (21, 34) of at least 2 and in the sequence (21, 34, 55) of at least 3 consecutive composites in A000045.

CROSSREFS

Cf. A005478, A090206.

Sequence in context: A108235 A130021 A003864 * A123255 A053750 A271921

Adjacent sequences:  A182599 A182600 A182601 * A182603 A182604 A182605

KEYWORD

nonn

AUTHOR

R. J. Mathar, Nov 22 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 3 08:48 EST 2016. Contains 278698 sequences.