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 A059331 #10 Sep 08 2022 08:45:02
%S A059331 113,281,353,593,617,1049,1097,1193,1481,1601,1753,1889,2129,2273,
%T A059331 2281,2393,2689,3089,3137,3761,3833,4001,4153,4217,4289,4457,4657,
%U A059331 4817,4937,5113,5393,5569,6521,6569,6761,7481,7577,7793,7817,7841,8273,8369,8537
%N A059331 Primes p such that x^24 = 2 has no solution mod p, but x^12 = 2 has a solution mod p.
%H A059331 Vincenzo Librandi, <a href="/A059331/b059331.txt">Table of n, a(n) for n = 1..370</a>
%t A059331 Select[Prime[Range[PrimePi[1000]]], !MemberQ[PowerMod[Range[#], 24, #], Mod[2, #]] && MemberQ[PowerMod[Range[#], 12, #], Mod[2, #]]&] (* _Vincenzo Librandi_, Sep 21 2013 *)
%o A059331 (Magma) [p: p in PrimesUpTo(9000) | not exists{x: x in ResidueClassRing(p) | x^24 eq 2} and exists{x: x in ResidueClassRing(p) | x^12 eq 2}]; // _Vincenzo Librandi_, Sep 21 2012
%Y A059331 A000040, A049556, A049544, A059264.
%K A059331 nonn,easy
%O A059331 1,1
%A A059331 _Klaus Brockhaus_, Jan 26 2001