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 A155143 #15 Dec 13 2024 15:12:40
%S A155143 17,37,89,107,109,197,199,233,307,397,433,449,467,487,557,593,613,647,
%T A155143 683,701,757,809,811,883,953,991,1009,1061,1063,1097,1117,1151,1153,
%U A155143 1259,1297,1459,1493,1511,1549,1601,1637,1657,1693,1747,1783,1889,1997
%N A155143 Primes p such that p-+2, p-+4, p-+6 are squarefree.
%C A155143 All terms == 1 or 8 mod 9. - _Robert Israel_, Jun 19 2016
%H A155143 John Cerkan, <a href="/A155143/b155143.txt">Table of n, a(n) for n = 1..10000</a>
%p A155143 filter:= t -> isprime(t) and andmap(numtheory:-issqrfree, [seq(seq(t+s*j, s=[-1,1]),j=[2,4,6])]):
%p A155143 select(filter, [seq(seq(i+j,j=[-1,1]),i=9..1000,9)]); # _Robert Israel_, Jun 19 2016
%t A155143 Select[Prime@ Range@ 302, Times @@ Boole@ Map[SquareFreeQ, # + (2 Range@ 7 - 8)] == 1 &] (* _Michael De Vlieger_, Jun 18 2016 *)
%t A155143 Select[Prime[Range[400]],AllTrue[#+{2,4,6,-2,-4,-6},SquareFreeQ]&] (* _Harvey P. Dale_, Dec 13 2024 *)
%Y A155143 Cf. A153213, A049282, A155139, A155140, A155141, A155142
%K A155143 nonn
%O A155143 1,1
%A A155143 _Vladimir Joseph Stephan Orlovsky_, Jan 21 2009