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 A059256 #7 Sep 08 2022 08:45:02
%S A059256 59,233,349,523,929,1103,1277,1451,1567,1741,1973,2089,2437,2843,3307,
%T A059256 3539,4003,4177,4409,4583,4931,5279,5569,5743,5801,6091,6323,6961,
%U A059256 7019,7193,7309,7541,8179,8237,8353,8527,8933,9049,9281,9397,9629,9803
%N A059256 Primes p such that x^29 = 2 has no solution mod p.
%C A059256 Complement of A049561 relative to A000040.
%H A059256 Vincenzo Librandi, <a href="/A059256/b059256.txt">Table of n, a(n) for n = 1..1000</a>
%t A059256 ok[p_]:= Reduce[Mod[x^29 - 2, p] == 0, x, Integers] == False; Select[Prime[Range[1300]], ok] (* _Vincenzo Librandi_, Sep 20 2012 *)
%o A059256 (Magma) [p: p in PrimesUpTo(10000) | not exists{x : x in ResidueClassRing(p) | x^29 eq 2} ]; // _Vincenzo Librandi_, Sep 20 2012
%Y A059256 Cf. A000040, A049561.
%K A059256 nonn,easy
%O A059256 1,1
%A A059256 _Klaus Brockhaus_, Jan 23 2001