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 A136800 #7 Apr 08 2015 15:31:27 %S A136800 3,3,3,5,5,3,3,5,5,5,3,5,3,5,7,3,3,3,13,3,5,9,5,5,3,5,5,9,3,11,11,3,3, %T A136800 5,9,5,5,5,5,3,9,13,3,3,13,5,9,3,5,7,5,5,3,5,7,3,7,9,9,5,3,5,7,3,3,11, %U A136800 7,3,7,3,5,11 %N A136800 Number of composites in prime gaps of size 3 or larger, in order of appearance. %C A136800 The sequence counts the terms in the runs of composites associated with A136798-A136799. %C A136800 A129856 is obtained by removing the composites (9, 15 etc.) from this sequence. %C A136800 This is sequence A046933, with the zero and all the 1's deleted. - _R. J. Mathar_, Jan 24 2008 %F A136800 a(n)=A136799(n)-A136798(n)+1. %e A136800 a(1)=3 because in the run 8, 9, 10 there are three terms. %t A136800 Select[#[[2]]-#[[1]]-1&/@Partition[Prime[Range[100]],2,1],#>2&] (* _Harvey P. Dale_, Apr 08 2015 *) %Y A136800 Cf. A136798, A136799, A136801. %K A136800 easy,nonn %O A136800 1,1 %A A136800 _Enoch Haga_, Jan 22 2008 %E A136800 Edited by _R. J. Mathar_, May 27 2009