login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165287 Primes which are the sum of at least 3 consecutive odd nonprimes (A014076) >1. 0
61, 71, 73, 97, 107, 163, 179, 197, 233, 239, 257, 263, 271, 307, 331, 349, 359, 367, 397, 409, 419, 421, 461, 467, 479, 487, 503, 523, 547, 571, 593, 599, 613, 617, 631, 659, 677, 691, 709, 727, 733, 743, 757, 761, 787, 809, 811, 821, 827, 839, 857 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..51.

EXAMPLE

15+21+25 = 61, 9+15+21+25+27 = 97.

MATHEMATICA

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]

PROG

(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

CROSSREFS

Cf. A106091.

Sequence in context: A039390 A043213 A043993 * A064229 A180555 A039478

Adjacent sequences:  A165284 A165285 A165286 * A165288 A165289 A165290

KEYWORD

nonn

AUTHOR

Vladimir Joseph Stephan Orlovsky, Sep 13 2009

EXTENSIONS

Edited by Ralf Stephan, Nov 26 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 17:01 EST 2021. Contains 349596 sequences. (Running on oeis4.)