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 A040070 #14 Jul 08 2025 22:45:14
%S A040070 13,19,37,43,61,73,97,103,109,127,139,151,157,163,181,193,199,211,241,
%T A040070 271,307,313,337,349,373,379,409,421,433,439,457,487,499,523,547,577,
%U A040070 601,607,613,619,631,661,691,709
%N A040070 Primes p such that x^3 = 15 has no solution mod p.
%C A040070 Complement of A040069 relative to A000040. - _Vincenzo Librandi_, Sep 17 2012
%H A040070 Vincenzo Librandi, <a href="/A040070/b040070.txt">Table of n, a(n) for n = 1..1000</a>
%t A040070 ok[p_]:= Reduce[Mod[x^3 - 15, p] == 0, x, Integers] == False;Select[Prime[Range[200]], ok] (* _Vincenzo Librandi_, Sep 17 2012 *)
%o A040070 (Magma) [p: p in PrimesUpTo(1000) | not exists{x : x in ResidueClassRing(p) | x^3 eq 15} ]; // _Vincenzo Librandi_, Sep 17 2012
%K A040070 nonn,easy
%O A040070 1,1
%A A040070 _N. J. A. Sloane_