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 A216735 #10 Mar 19 2023 13:35:42
%S A216735 5,7,13,17,23,29,31,37,41,47,53,61,71,73,79,89,97,101,103,109,113,127,
%T A216735 137,149,151,157,167,173,181,191,193,197,199,223,229,233,239,241,263,
%U A216735 269,271,277,293,311,313,317,349,353,359,367,373,383,389,397,401,409,421,431
%N A216735 Primes p such that x^8 = -2 has no solution mod p.
%C A216735 Complement of A051073 relative to A000040.
%H A216735 Vincenzo Librandi, <a href="/A216735/b216735.txt">Table of n, a(n) for n = 1..1000</a>
%t A216735 ok[p_] := Reduce[Mod[x^8 + 2, p] == 0, x, Integers] == False; Select[Prime[Range[100]], ok]
%o A216735 (Magma) [p: p in PrimesUpTo(500) | forall{x: x in ResidueClassRing(p) | x^8 ne -2}]; // _Bruno Berselli_, Sep 20 2012
%o A216735 (PARI) select(x->!ispower(Mod(-2, x), 8), primes(100)) \\ _Michel Marcus_, Mar 19 2023
%Y A216735 Cf. A000040, A051073.
%K A216735 nonn,easy
%O A216735 1,1
%A A216735 _Vincenzo Librandi_, Sep 15 2012