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.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

8, 21, 21, 2584, 2584, 832040, 832040, 832040, 832040, 832040, 832040, 832040, 832040, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976, 4807526976
Offset: 1

Views

Author

R. J. Mathar, Nov 22 2010

Keywords

Examples

			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

Programs

  • Mathematica
    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 *)

Formula

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