[seqfan] Re: smallest odd prime that divides n + sum of all smaller primes

Fri Nov 11 22:22:58 CET 2016

```Shouldn't this be defined as "... or zero if no such prime exists", with a comment that all 0's are conjectured?

-----Original Message-----
From: Neil Fernandez <primeness at borve.org>
To: seqfan <seqfan at list.seqfan.eu>
Sent: Fri, Nov 11, 2016 3:19 pm
Subject: [seqfan] Re: smallest odd prime that divides n + sum of all smaller primes

Many thanks, Jack. So a(2) and a(3) do exist. I've now put them in andattributed them to you. I'd already inserted the 647. Did you look fora(12)?NeilIn message <98cb35b8-c193-5aca-2a39-4309bca602a3 at brennen.net>, JackBrennen <jfb at brennen.net> writes>I get this, which fills in your missing entries, and corrects one value>that you omitted:>>[5, 3, 30915397, 11339869, 3, 5, 859, 3, 41, 233, 3, 7, 0, 3, 307, 5, 3, >1459, 7, 3, 5, 9907, 3, 647, 13, 3, 31, 11]>>>On 11/11/2016 11:44 AM, Neil Fernandez wrote:>> Hello,>>>> A sequence I've just submitted (A274649):>>>> a(n) is the smallest odd prime that divides n + the sum of all smaller>> primes, or 0 if unknown>>>> Starting with a(0), the sequence runs>>>> 5, 3, 0, 0, 3, 5, 859, 3, 41, 233, 3, 7, 0, 3, 307, 5, 3, 1459, 7, 3, 5,>> 9907, 3, 13, 3, 31, 11>>>> Does a(n) exist for all n?>> If a(2) or a(3) exists, it is greater than 600000.>>>> Neil>>>>>> -->> Seqfan Mailing list - http://list.seqfan.eu/>>>>>>>-- Neil Fernandez--Seqfan Mailing list - http://list.seqfan.eu/

```