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