OFFSET
1,2
COMMENTS
Conjectured to be a permutation of the positive integers: a(10^6) = 10^6 + 9 and all numbers below 10^6 - 7 are used at that point. - M. F. Hasler, Nov 15 2019
LINKS
Jean-Marc Falcoz, Table of n, a(n) for n = 1..10000
EXAMPLE
a(1) = 1 is the smallest possible choice for the first term.
a(2) = 2 as 2 is the smallest available integer not leading to a contradiction. Note that as 1 + 2 = 3 we already have one prime sum (on the required two) with the 5-tuple {1,2,a(3),a(4),a(5)}.
a(3) = 3 as 3 is the smallest available integer not leading to a contradiction. Note that as 2 + 3 = 5 we now have the two prime sums required with the 5-tuple {1,2,3,a(4),a(5)}.
a(4) = 7 as a(4) = 4, 5 or 6 would lead to a contradiction: indeed, the quintuplets {1,2,3,4,a(5)}, {1,2,3,5,a(5)} and {1,2,3,6,a(5)} will produce more than the two required prime sums. With a(4) = 7 we have no contradiction as the 5-tuple {1,2,3,7,a(5)} has now exactly two prime sums: 1 + 2 = 3 and 2 + 3 = 5.
a(5) = 13 as a(5) = 4, 5, 6, 8, 9, 10, 11 or 12 would again lead to a contradiction (more than 2 prime sums with the 5-tuple); in combination with any other term before it, a(5) = 13 will produce only composite sums.
a(6) = 5 as 5 is the smallest available integer not leading to a contradiction: indeed, the 5-tuple {2,3,7,13,5} shows exactly the two prime sums we are looking for: 2 + 3 = 5 and 2 + 5 = 7.
And so on.
PROG
(PARI) A329413(n, show=0, o=1, N=2, M=4, p=[], U, u=o)={for(n=o, n-1, show&&print1(o", "); U+=1<<(o-u); U>>=-u+u+=valuation(U+1, 2); p=concat(if(#p>=M, p[^1], p), o); my(c=N-sum(i=2, #p, sum(j=1, i-1, isprime(p[i]+p[j])))); if(#p<M && sum(i=1, #p, isprime(p[i]+u))<=c, o=u)|| for(k=u, oo, bittest(U, k-u) || sum(i=1, #p, isprime(p[i]+k))!=c || [o=k, break])); o} \\ Optional args: show=1: print a(o..n-1); o=0: start with a(0) = 0 (A329453), N, M: produce N primes using M+1 consecutive terms. - M. F. Hasler, Nov 15 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Eric Angelini and Jean-Marc Falcoz, Nov 14 2019
STATUS
approved