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 A059858 #10 Jan 29 2019 04:38:02 %S A059858 151,241,251,431,571,641,911,971,1181,1811,2011,2351,2381,2411,2731, %T A059858 3061,3121,3221,3251,3301,3331,3361,3391,3541,3761,3821,3881,4211, %U A059858 4751,4861,4871,4931,5021,5381,5441,5471,5581,5641,5711,5821,5861 %N A059858 Primes p such that x^5 == 2 (mod p) has five solutions. %C A059858 For any prime modulus, there must be exactly 0, 1 or 5 solutions to the equation with x between 0 and p - 1. %C A059858 Primes == 1 (mod 5) such that 2 is a quintic residue, that is, primes p such that 2^((p-1)/5) == 1 (mod p). - _Jianing Song_, Jan 27 2019 %o A059858 (PARI) forstep(p=11, 5000, 10, if(isprime(p)&&Mod(2,p)^((p-1)/5)==1, print1(p, ", "))) \\ _Jianing Song_, Jan 27 2019 %Y A059858 Cf. A040159. %K A059858 nonn %O A059858 1,1 %A A059858 _Don Reble_, Sep 20 2001