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 A040121 #13 Jul 08 2025 22:49:09
%S A040121 7,11,13,17,19,23,29,47,59,61,73,89,97,101,103,109,113,127,131,137,
%T A040121 139,149,157,167,179,181,193,197,211,223,229,233,251,257,263,269,281,
%U A040121 293,313,331,337,349,353,367,373
%N A040121 Primes p such that x^4 = 10 has no solution mod p.
%C A040121 Complement of A040119 relative to A000040. - _Vincenzo Librandi_, Sep 17 2012
%H A040121 Vincenzo Librandi, <a href="/A040121/b040121.txt">Table of n, a(n) for n = 1..1000</a>
%t A040121 ok[p_]:= Reduce[Mod[x^4 - 10, p] == 0, x, Integers] == False;Select[Prime[Range[100]], ok] (* _Vincenzo Librandi_, Sep 17 2012 *)
%o A040121 (Magma) [p: p in PrimesUpTo(500) | not exists{x : x in ResidueClassRing(p) | x^4 eq 10} ]; // _Vincenzo Librandi_, Sep 17 2012
%o A040121 (PARI) is(p)=!ispower(Mod(10,p),4) && isprime(p)
%o A040121 select(is, primes(100)) \\ _Charles R Greathouse IV_, Aug 10 2022
%K A040121 nonn,easy
%O A040121 1,1
%A A040121 _N. J. A. Sloane_