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