Sum Of Primes Is Composite

[Leroy Quet]

I just submitted these two related sequences:

%S A138980
1,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,61,67,71,73
%N A138980 a(0)=1. For n>=1, a(n) = smallest
prime > a(n-1) such that (sum{k=0 to n} a(k)) is
composite.
%Y A138980 A138981
%O A138980 0
%K A138980 ,more,nonn,

%S A138981
1,4,9,16,27,40,57,76,99,128,159,196,237,280,327,380,441,508,579,652
%N A138981 a(n) = sum{k=0 to n} A138980(k).
%C A138981 By definition, every term is nonprime
(ie. is 1 or composite).
%Y A138981 A138980
%O A138981 0
%K A138981 ,more,nonn,

First, I did this without computer or calculator,
though I double-checked it. So maybe I made an
error.

I would like to submit (or have someone else
submit) the sequence of primes NOT in A138980.

So far, there are only two such primes: 2, 59.

Could someone please extend that list?


Note: The terms I give for A138980 match (except
my 1 is replaced with a 2) sequence A049561.
("Primes p such that x^29 = 2 has a solution mod
p.")
I am certain -- well, as certain as I can be
without proof -- that A049561 is not the same as
my sequence.
I mean, if they were the same, I would be REALLY
shocked. But are they different? More terms
calculated for my sequence should answer that
question once and for all.

Leroy




      ____________________________________________________________________________________
You rock. That's why Blockbuster's offering you one month of Blockbuster Total Access, No Cost.  
http://tc.deals.yahoo.com/tc/blockbuster/text5.com