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 A051089 #17 Sep 08 2022 08:44:59
%S A051089 2,3,19,43,59,67,83,107,139,163,179,227,251,257,283,307,337,347,379,
%T A051089 419,443,467,499,523,547,563,571,587,617,619,643,659,683,739,787,827,
%U A051089 859,883,907,947,971,1019,1033,1049,1097,1123,1163,1187,1193,1217,1249,1259,1283,1307,1427,1459,1483,1499,1523
%N A051089 Primes p such that x^40 = -2 has a solution mod p.
%C A051089 Complement of A216751 relative to A000040. - _Vincenzo Librandi_, Sep 17 2012
%H A051089 Vincenzo Librandi, <a href="/A051089/b051089.txt">Table of n, a(n) for n = 1..1000</a>
%t A051089 ok[p_]:= Reduce[Mod[x^40 + 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[400]], ok] (* _Vincenzo Librandi_, Sep 15 2012 *)
%o A051089 (PARI) /* see A051071 */
%o A051089 (Magma) [p: p in PrimesUpTo(1525) | exists(t){x : x in ResidueClassRing(p) | x^40 eq - 2}]; // _Vincenzo Librandi_, Sep 15 2012
%K A051089 nonn,easy
%O A051089 1,1
%A A051089 _N. J. A. Sloane_
%E A051089 More terms from _Joerg Arndt_, Jul 27 2011