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 A040993 #21 Jun 19 2023 04:23:55
%S A040993 3,5,7,11,13,19,29,37,43,53,59,61,67,73,79,83,97,101,103,107,109,131,
%T A040993 139,149,151,157,163,173,179,181,193,197,199,211,227,229,241,251,269,
%U A040993 271,277,283,293,307,313,317,331,337,347,349,367,373,379,389,397,409
%N A040993 Primes p such that x^6 = 2 has no solution mod p.
%C A040993 Complement of A040992 relative to A000040. Coincides for the first 58 terms with A212375, that is the sequence of primes p such that x^18 = 2 has no solution mod p (first divergence is at 433, cf. A059664). Also coincides for the first 58 terms with sequence of primes p such that x^54 = 2 has no solution mod p (first divergence is at 433, cf. A059665). The sequence for x^18 and the sequence for x^54 coincide for the first 379 terms (first divergence is at 3943, cf. A059666). - _Klaus Brockhaus_, Feb 04 2001
%H A040993 Bruno Berselli, <a href="/A040993/b040993.txt">Table of n, a(n) for n = 1..1000</a>
%t A040993 Select[Prime[Range[PrimePi[500]]], ! MemberQ[PowerMod[Range[#], 6, #], Mod[2, #]] &] (* _Bruno Berselli_, Sep 13 2012 *)
%t A040993 ok[p_] := Reduce[Mod[x^6 - 2, p] == 0, x, Integers] == False; Select[Prime[Range[80]], ok] (* _Vincenzo Librandi_, Sep 21 2012 *)
%o A040993 (Magma) [p: p in PrimesUpTo(500) | forall{x: x in ResidueClassRing(p) | x^6 ne 2}]; // _Bruno Berselli_, Sep 13 2012
%Y A040993 Cf. A000040, A040992, A049550, A059664, A059665, A059666, A212375.
%K A040993 nonn,easy
%O A040993 1,1
%A A040993 _N. J. A. Sloane_
%E A040993 A212375 added in the Brockhaus comment from _Bruno Berselli_, Sep 13 2012