This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A214773 #13 Jul 30 2012 13:07:06
%S A214773 2,3,11,19,59,83,127,163,199,227,271,311,383,419,443,811,911,919,1063,
%T A214773 1163,1171,1319,1427,1559,2099,2143,2543,2683,2999,3259,4519,5099,
%U A214773 5171,5711,5783,6211,6719,8111,8219,9203,11003,12227,12511,12659,13259,13883
%N A214773 Primes such that all pairwise sums are squarefree.
%C A214773 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.
%C A214773 The sequence is apparently infinite.
%H A214773 Zak Seidov, <a href="/A214773/b214773.txt">Table of n, a(n) for n = 1..1000</a>
%t A214773 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 *)
%Y A214773 Cf. A005117, A077224, A214735.
%K A214773 nonn
%O A214773 1,1
%A A214773 _Zak Seidov_, Jul 28 2012