A182601 Position (index) of the smallest Fibonacci number in a sequence of at least n consecutive composite Fibonacci numbers.

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

Author

R. J. Mathar, Nov 22 2010

Keywords

• nonn

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

• Robert Israel, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A005478, A090206.

Programs

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

Formula

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