[seqfan] Seq. needed: linear comb. of primes

[Neil Sloane]

Dear Seqfans,
take the first n primes and combine them with coefficients +1 and -1;
a(n) is the smallest number (in absolute value) that can be obtained.
I get by hand (for n>=1)
2 1 0 1 0 1 0 1 0 1 0 1
How does it continue? Does 1,0 repeat for ever?
E.g. a(3) = 0 from -2-3+5

a(11)=0 from 2-3-5-7+11-13+17+19-23-29+31= 0

A214912 (which I just rescued from the "waiting to be submitted" stack)
is an upper bound, but has a(11)=2 so is a different sequence.

This must be a classical problem! Richard?

Neil


-- 
Dear Friends, I have now retired from AT&T. New coordinates:

Neil J. A. Sloane, President, OEIS Foundation
11 South Adelaide Avenue, Highland Park, NJ 08904, USA
Phone: 732 828 6098; home page: http://NeilSloane.com
Email: njasloane at gmail.com