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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Dec 08 2015 03:18:06
%S 1,3,5,113,181,661,10891,927149,88070399,15288362671
%N Smallest sequence of noncomposite numbers such that no sum of at least two terms is prime.
%o (PARI) print1(1); a=[1]; for(n=1, 10, forprime(p=vecmin(a)+1, , 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
%Y Cf. A153136, A153138, A133660, A052349, A254337, A254341.
%K more,nonn
%O 1,2
%A _Benoit Jubin_, Dec 19 2008
%E a(8)-a(10) from _Donovan Johnson_, Dec 23 2008