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.

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

This page as a plain text file.
%I A182602 #6 Aug 24 2024 13:37:40
%S A182602 8,21,21,2584,2584,832040,832040,832040,832040,832040,832040,832040,
%T A182602 832040,4807526976,4807526976,4807526976,4807526976,4807526976,
%U A182602 4807526976,4807526976,4807526976,4807526976,4807526976,4807526976
%N A182602 Smallest Fibonacci number in a sequence of at least n consecutive composite Fibonacci numbers.
%F A182602 a(n) = A000045(A182601).
%F A182602 a(n) = min{ A000045(i): A000045(j) in A002808 for all j=i..i+n-1}.
%e A182602 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.
%t A182602 Fibonacci[#]&/@(Flatten[Table[SequencePosition[Table[If[CompositeQ[Fibonacci[n]],1,0],{n,100}],PadRight[ {},k,1],1],{k,100}],1][[;;,1]]) (* _Harvey P. Dale_, Aug 24 2024 *)
%Y A182602 Cf. A005478, A090206.
%K A182602 nonn
%O A182602 1,1
%A A182602 _R. J. Mathar_, Nov 22 2010