OFFSET
1,2
COMMENTS
Is the sequence infinite? Is each prime a(i)+a(j)+1, i<>j, always distinct?
Except for a(1), a(n) == 3 (mod 6). - Robert G. Wilson v, Jun 02 2006.
The Hardy-Littlewood k-tuple conjecture would imply that this sequence is infinite. Note that, for n>2, a(n)+2 and a(n)+4 are both primes, so a proof that this sequence is infinite would also show that there are infinitely many twin primes. - N. J. A. Sloane, Apr 21 2007
LINKS
G. H. Hardy and J. E. Littlewood, Some problems of 'Partitio numerorum'; III: On the expression of a number as a sum of primes, Acta Math., Vol. 44, No. 1 (1923), pp. 1-70.
FORMULA
a(n) = (A115760(n) - 1)/2.
EXAMPLE
a(1)=1, a(2)=3, but 5+1+1=7, 5+3+1=9; 7+1+1=9, 7+3+1=11; 9+1+1=11, 9+3+1=13 so a(3)=9.
MAPLE
EP:=[]: for w to 1 do for n from 1 to 8*10^6 do s:=2*n-1; Q:=map(z->z+s+1, EP); if andmap(isprime, Q) then EP:=[op(EP), s]; print(nops(EP), s); fi od od; EP;
MATHEMATICA
a[1] = 1; a[2] = 3; a[n_] := a[n] = Block[{k = a[n - 1] + 6, t = Table[ a[i], {i, n - 1}] + 1}, While[ First@ Union@ PrimeQ[k + t] == False, k += 6]; k]; Do[ Print[ a[n]], {n, 15}] (* Robert G. Wilson v, Jun 03 2006 *)
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Walter Kehowski, May 29 2006
EXTENSIONS
a(12) from Robert G. Wilson v, Jun 03 2006
a(13) from Walter Kehowski, Jun 03 2006
Definition corrected by Walter Kehowski, Nov 03 2008
a(14)-a(16) from Don Reble added by N. J. A. Sloane, Sep 18 2012
a(17)-a(18) from Don Reble, Aug 17 2021
STATUS
approved