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.
%I A182600 #13 Jul 25 2014 08:55:08
%S A182600 1,3,1,3,5,5,13,3,35,47,5,221,71,1,15,59,59,1,2399,1751,663,3923,365,
%T A182600 4753,11129,5195,5241,1511,13321,31005,23071,25109,18069,53015,196271,
%U A182600 36401,156259,3647,11021,326805,118379,235709,350399,167051,165661,935631
%N A182600 Run length of the n-th run of Fibonacci composites.
%C A182600 There is no upper bound to the entries: F_{k*n} is divisible by F_k, so whenever integers j, j+1, ..., j+n are composite (and > 4), F_j, ..., F_{j+n} are also composite. - _Robert Israel_, Nov 19 2010
%F A182600 a(n) = A001605(n+3)-A001605(n+2)-1.
%e A182600 The first run contains A000045(6), the second A000045(8..10), the third A000045(12), the fourth A000045(14..16).
%Y A182600 Cf. A000045, A001605.
%K A182600 nonn
%O A182600 1,2
%A A182600 _R. J. Mathar_, Nov 22 2010