login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A182601
Position (index) of the smallest Fibonacci number in a sequence of at least n consecutive composite Fibonacci numbers.
2
6, 8, 8, 18, 18, 30, 30, 30, 30, 30, 30, 30, 30, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 138, 138, 138
OFFSET
1,1
COMMENTS
All entries are of the form A001605(.)+1.
The records in A182600 are 1, 3, 5, 13, 35, 47, 221,... with first differences 2, 2, 8, 22, 12, 174,... and these are the frequencies (repetitions) of the entries in this sequence here.
LINKS
FORMULA
min{ i: A000045(j) in A002808 for all j=i..i+n-1}.
MAPLE
# using b-file for A001605 as a list B001605
dB:= B001605[2..-1]-B001605[1..-2]:
f:= proc(n) local i;
for i from 1 do if dB[i] >= n+1 then return B001605[i]+1 fi od
end proc:
map(f, [$1..100]); # Robert Israel, Dec 24 2024
CROSSREFS
Sequence in context: A315948 A315949 A135581 * A261506 A021596 A166528
KEYWORD
nonn
AUTHOR
R. J. Mathar, Nov 22 2010
STATUS
approved