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

 

Logo
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

%I #4 Mar 30 2012 17:40:29

%S 8,21,21,2584,2584,832040,832040,832040,832040,832040,832040,832040,

%T 832040,4807526976,4807526976,4807526976,4807526976,4807526976,

%U 4807526976,4807526976,4807526976,4807526976,4807526976,4807526976

%N Smallest Fibonacci number in a sequence of at least n consecutive composite Fibonacci numbers.

%F a(n) = A000045(A182601).

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

%e 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.

%Y Cf. A005478, A090206.

%K nonn

%O 1,1

%A _R. J. Mathar_, Nov 22 2010

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 11:14 EDT 2024. Contains 371791 sequences. (Running on oeis4.)