OFFSET
1,1
COMMENTS
a(n+1) is the smallest prime p > a(n) such that all sums a(i)+p, i-1..n are squarefree. All odd terms = 3 mod 4.
The sequence is apparently infinite.
LINKS
Zak Seidov, Table of n, a(n) for n = 1..1000
MATHEMATICA
sumsSqFree[t_, p_] := And @@ SquareFreeQ /@ (t + p); t = {2}; Do[p = NextPrime[t[[-1]]]; While[! sumsSqFree[t, p], p = NextPrime[p]]; AppendTo[t, p], {50}]; t (* T. D. Noe, Jul 30 2012 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Zak Seidov, Jul 28 2012
STATUS
approved