The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A153138 Smallest sequence of odd primes such that no sum of at least two terms is prime 2
 3, 5, 7, 83, 317, 383, 29567, 423509, 118661483, 52542428123 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS PROG (PARI) a=[]; for(n=1, 10, forprime(p=if(a, a[#a]+2, 3), , setsearch(a, p)&&next; for(i=1, 2^#a-1, isprime(normlp(vecextract(a, i), 1)+p)&&next(2)); a=concat(a, p); print1(p", "))) \\ Very simplistic, should at least avoid an odd number of terms in the partial sum of earlier terms. \\ M. F. Hasler, Jan 29 2015 CROSSREFS Cf. A153136, A153137, A133660, A052349, A254337, A254341. Sequence in context: A119939 A306573 A254925 * A201270 A160360 A082697 Adjacent sequences:  A153135 A153136 A153137 * A153139 A153140 A153141 KEYWORD more,nonn AUTHOR Benoit Jubin, Dec 19 2008 EXTENSIONS a(8)-a(10) from Donovan Johnson, Dec 23 2008 STATUS approved

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

Last modified November 26 10:43 EST 2022. Contains 358356 sequences. (Running on oeis4.)