|
|
A153136
|
|
Smallest sequence of primes such that no sum of at least two terms is prime
|
|
4
|
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
PROG
|
(PARI) a=[]; for(n=1, 10, forprime(p=2, , 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 odd primes in the partial sum of earlier terms. \\ M. F. Hasler, Jan 29 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|