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 A051094 #16 Sep 08 2022 08:44:59
%S A051094 2,3,17,19,43,59,67,73,83,89,97,107,113,137,139,163,179,193,227,233,
%T A051094 241,257,283,307,313,337,347,353,379,409,419,433,443,449,457,467,499,
%U A051094 523,547,563,569,571,577,587,593,617,619,641,643,659,673,683,739,769,787,809,827,857,859,883,907,929,937,947,953,971,977,1009,1019,1033,1049
%N A051094 Primes p such that x^50 = -2 has a solution mod p.
%C A051094 Complement of A216770 relative to A000040. - _Vincenzo Librandi_, Sep 17 2012
%H A051094 Vincenzo Librandi, <a href="/A051094/b051094.txt">Table of n, a(n) for n = 1..1000</a>
%t A051094 ok[p_]:= Reduce[Mod[x^50 + 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[400]], ok] (* _Vincenzo Librandi_, Sep 16 2012 *)
%o A051094 (PARI) /* see A051071 */
%o A051094 (Magma) [p: p in PrimesUpTo(1050) | exists(t){x : x in ResidueClassRing(p) | x^50 eq - 2}]; // _Vincenzo Librandi_, Sep 16 2012
%K A051094 nonn,easy
%O A051094 1,1
%A A051094 _N. J. A. Sloane_
%E A051094 More terms from _Joerg Arndt_, Jul 27 2011