login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A082931
a(1) = 1; a(n) = least k > a(n-1) such that a(i)+k is prime for some i < n and each prime of form a(i)+a(j) occurs for unique i <= j.
3
1, 2, 3, 5, 8, 14, 20, 23, 24, 37, 43, 48, 49, 55, 61, 75, 90, 109, 117, 118, 121, 139, 141, 157, 183, 193, 199, 212, 223, 229, 241, 245, 271, 277, 296, 301, 313, 320, 321, 331, 363, 368, 393, 403, 410, 422, 439, 457, 468, 469, 481, 491, 511, 525, 530, 535, 607
OFFSET
1,2
MATHEMATICA
a[1]=1; p[1]={2}; a[n_] := Module[{k, new}, For[k=a[n-1]+1, Intersection[p[n-1], (new=Select[(a/@Range[n-1])+k, PrimeQ])]!={}||new=={}, k++, Null]; p[n]=Union[p[n-1], new]; a[n]=k]
CROSSREFS
KEYWORD
nonn
AUTHOR
David W. Wilson, Apr 14 2003
STATUS
approved