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 A040069 #14 Jul 08 2025 22:45:07
%S A040069 2,3,5,7,11,17,23,29,31,41,47,53,59,67,71,79,83,89,101,107,113,131,
%T A040069 137,149,167,173,179,191,197,223,227,229,233,239,251,257,263,269,277,
%U A040069 281,283,293,311,317,331,347,353
%N A040069 Primes p such that x^3 = 15 has a solution mod p.
%C A040069 Complement of A040070 relative to A000040. - _Vincenzo Librandi_, Sep 13 2012
%H A040069 Vincenzo Librandi, <a href="/A040069/b040069.txt">Table of n, a(n) for n = 1..1000</a>
%t A040069 ok [p_]:=Reduce[Mod[x^3 - 15, p] == 0, x, Integers] =!= False; Select[Prime[Range[180]], ok] (* _Vincenzo Librandi_, Sep 11 2012 *)
%o A040069 (Magma) [p: p in PrimesUpTo(450) | exists(t){x : x in ResidueClassRing(p) | x^3 eq 15}]; // _Vincenzo Librandi_, Sep 11 2012
%o A040069 (PARI) select(n->ispower(Mod(15, n),3), primes(500)) \\ _Charles R Greathouse IV_, Sep 11 2012
%Y A040069 Cf. A000040, A040070.
%K A040069 nonn,easy
%O A040069 1,1
%A A040069 _N. J. A. Sloane_