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 A343241 #12 Jun 10 2021 16:56:48
%S A343241 2,17,23,47,53,83,107,113,137,167,173,197,227,233,257,263,293,317,347,
%T A343241 353,383,443,467,503,557,563,587,593,617,647,653,677,683,743,773,797,
%U A343241 827,857,863,887,947,953,977,983
%N A343241 Primes congruent to 2 or 8 modulo 15.
%C A343241 This sequence is the complement of A033212 (primes congruent to 1 or 4 mod(15)) relative to the primes p with Jacobi(p|15) = +1 (A191018).
%C A343241 There is neither a solution x of the congruence x^2 == a(n) (mod 3) nor of x^2 == a(n) (mod 5) (the Legendre symbols are -1 in both cases, and Jacobi(a(n)|15) = +1).
%t A343241 Select[Range[1000], PrimeQ[#] && MemberQ[{2, 8}, Mod[#, 15]] &] (* _Amiram Eldar_, May 20 2021 *)
%Y A343241 Cf. A033212, A106859 (with 3 and 5), A191018.
%K A343241 nonn,easy
%O A343241 1,1
%A A343241 _Wolfdieter Lang_, May 20 2021