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 A165287 #6 Nov 26 2013 06:52:59
%S A165287 61,71,73,97,107,163,179,197,233,239,257,263,271,307,331,349,359,367,
%T A165287 397,409,419,421,461,467,479,487,503,523,547,571,593,599,613,617,631,
%U A165287 659,677,691,709,727,733,743,757,761,787,809,811,821,827,839,857
%N A165287 Primes which are the sum of at least 3 consecutive odd nonprimes (A014076) >1.
%e A165287 15+21+25 = 61, 9+15+21+25+27 = 97.
%t A165287 lst={};Do[If[PrimeQ[m],Continue[]];s=m;Do[If[PrimeQ[n],Continue[]];s+=n;If[PrimeQ[s],If[s<=2917,AppendTo[lst,s]]],{n,m+2,2*6!,2}],{m,1,2*6!,2}];lst=Take[Union@lst,200]
%o A165287 (PARI) N=1000;v=vector(N);L=listcreate();n=9;while(n<N,if(!isprime(n),listput(L,n));n=n+2);vv=Vec(L);forstep(k=3,#vv,2,for(offs=1,#vv-k+1,s=sum(i=offs,offs+k-1,vv[i]);if(isprime(s)&&s<=N,v[s]=1)));for(n=60,#v,if(v[n],print1(n,","))) \\ _Ralf Stephan_, Nov 26 2013
%Y A165287 Cf. A106091.
%K A165287 nonn
%O A165287 1,1
%A A165287 _Vladimir Joseph Stephan Orlovsky_, Sep 13 2009
%E A165287 Edited by _Ralf Stephan_, Nov 26 2013