OFFSET
1,1
COMMENTS
Conjecture: a(n) > 0 for all n.
LINKS
Robert Israel, Table of n, a(n) for n = 1..500
EXAMPLE
a(3) = 116 because 116 = 7 + 109 = 13 + 103 = 43 + 73 is the sum of two upper twin primes in exactly 3 ways, and no smaller number works.
MAPLE
N:= 60: V:= Vector(N): V[1]:= 12: count:= 1:
P:= select(t -> isprime(t) and isprime(t-2), [seq(i, i=7..10^5, 6)]):
for k from 14 by 6 to 10^5 while count < N do
t:= 0:
for i from 1 do
q:= k - P[i];
if q <= P[i] then break fi;
if member(q, P) then t:= t+1 fi;
od;
if t >= 2 and t <= N and V[t] = 0 then V[t]:= k; count:= count+1; fi
od:
convert(V, list);
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Israel, May 28 2026
STATUS
approved
