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 A051095 #18 Sep 08 2022 08:44:59
%S A051095 2,3,11,19,43,59,67,73,83,89,107,113,139,163,179,211,227,233,251,257,
%T A051095 281,283,307,331,337,347,353,379,419,467,491,499,523,563,571,577,587,
%U A051095 593,601,617,619,643,659,683,691,739,787,811,827,881,883,907,947,971,1019,1033,1049,1051,1091,1097
%N A051095 Primes p such that x^52 = -2 has a solution mod p.
%C A051095 Complement of A216771 relative to A000040. - _Vincenzo Librandi_, Sep 17 2012
%H A051095 Vincenzo Librandi, <a href="/A051095/b051095.txt">Table of n, a(n) for n = 1..1000</a>
%t A051095 ok[p_]:= Reduce[Mod[x^52 + 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[500]], ok] (* _Vincenzo Librandi_, Sep 16 2012 *)
%o A051095 (PARI) /* see A051071 */
%o A051095 (Magma) [p: p in PrimesUpTo(1100) | exists(t){x : x in ResidueClassRing(p) | x^52 eq - 2}]; // _Vincenzo Librandi_, Sep 16 2012
%K A051095 nonn,easy
%O A051095 1,1
%A A051095 _N. J. A. Sloane_
%E A051095 More terms from _Joerg Arndt_, Jul 27 2011