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