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

[Neil Sloane]

Sorry, I meant to say that A215030 is an upper bound
( I was led to create A215030 by editing A214912, which was based on
StackExchange, <a href="
http://math.stackexchange.com/questions/176394/a-prime-number-pattern">A
prime number pattern</a>, Jul 29 2012, and it may be that this link already
has the answer to my question)

On Sun, Aug 5, 2012 at 4:17 PM, Neil Sloane <njasloane at gmail.com> wrote:

> 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
>
>
>


-- 
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