cp's OEIS Frontend

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.

A280010 Orders of consecutive clusters of non-Chen primes.

This page as a plain text file.
%I A280010 #24 Mar 05 2017 05:39:21
%S A280010 1,1,2,1,1,1,1,1,1,1,1,1,2,1,1,1,1,2,1,1,1,2,1,1,1,1,1,3,1,1,2,1,1,3,
%T A280010 1,1,1,1,1,1,1,1,1,1,1,1,1,1,3,1,1,2,1,2,1,1,3,1,2,1,1,1,2
%N A280010 Orders of consecutive clusters of non-Chen primes.
%H A280010 Charles R Greathouse IV, <a href="/A280010/b280010.txt">Table of n, a(n) for n = 1..10000</a>
%e A280010 a(1)=1 since the first cluster consists of the single value p=43.
%e A280010 a(3)=2 since the third cluster consists of the consecutive non-Chen primes {73,79}.
%t A280010 Length /@ DeleteCases[Split@ Table[Boole@ Nand[# != 1, PrimeOmega@ # <= 2] &[# + 2] &@ Prime@ n, {n, 300}], k_ /; Total@ k == 0] (* _Michael De Vlieger_, Feb 27 2017 *)
%o A280010 (PARI) do(lim)=my(v=List(), u=v, r, s); forprime(p=2, lim\2, forprime(q=2, min(lim\p, p), listput(u, p*q))); u=Set(u); r=3; forprime(p=5, lim, if(p-r==2 || setsearch(u, r+2), if(s, listput(v, s); s=0), s++); r=p); u=0; Vec(v) \\ _Charles R Greathouse IV_, Feb 27 2017
%Y A280010 Cf. A102540, A280009.
%K A280010 nonn
%O A280010 1,3
%A A280010 _Enrique Navarrete_, Feb 21 2017