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 A216776 #13 Sep 08 2022 08:46:03
%S A216776 5,7,13,23,29,31,37,47,53,61,71,79,101,103,109,127,149,151,157,167,
%T A216776 173,181,191,197,199,223,229,239,263,269,271,277,293,311,317,349,359,
%U A216776 367,373,383,389,397,421,431,439,461,463,479,487,503,509,541,557,599
%N A216776 Primes p such that x^62 = -2 has no solution mod p.
%C A216776 Complement of A051100 relative to A000040.
%C A216776 a(n) = A045355(n+1) up to n=116, and then both sequences start to differ substantially. - _R. J. Mathar_, Sep 19 2012
%H A216776 Vincenzo Librandi, <a href="/A216776/b216776.txt">Table of n, a(n) for n = 1..1000</a>
%t A216776 ok[p_]:=Reduce[Mod[x^62 + 2, p] == 0, x, Integers] == False;Select[Prime[Range[220]], ok]
%o A216776 (Magma) [p: p in PrimesUpTo(700) | not exists{x : x in ResidueClassRing(p) | x^62 eq -2} ];
%Y A216776 Cf. A000040, A051100.
%K A216776 nonn,easy
%O A216776 1,1
%A A216776 _Vincenzo Librandi_, Sep 16 2012