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 A275773 #17 Aug 08 2019 11:05:36 %S A275773 4421,4733,5669,5981,8581,9413,10453,11597,13963,14327,14951,19267, %T A275773 22699,22907,23557,25117,25819,26417,28627,31799,32579,35491,37441, %U A275773 41549,44773,44851,45553,46619,46957,48179,49297,49921,49999,50207,52859,53639,60217,64403 %N A275773 Primes p congruent to 1 modulo 13 such that x^13 = 2 has a solution modulo p. %C A275773 Intersection of A049545 and A268753. %C A275773 These are the counterexamples mentioned in the Sep 12 2012 comment from _Bruno Berselli_ in A059245. %e A275773 4421 is in the sequence since it is prime, it is congruent to 1 (mod 13), and x^13 == 2 (mod 4421) has the solution x = 162. - _Michael B. Porter_, Aug 26 2016 %t A275773 Quiet@ Select[Prime@ Range[10^4], And[Mod[#, 13] == 1, IntegerQ@ PowerMod[2, 1/13, #]] &] (* _Michael De Vlieger_, Aug 10 2016 *) %o A275773 (PARI) forprime(p=1, 1e6, if(Mod(p, 13)==1 && ispower(Mod(2, p), 13), print1(p, ", "))) %Y A275773 Cf. A049545, A059245, A268753. %K A275773 nonn %O A275773 1,1 %A A275773 _Felix Fröhlich_, Aug 08 2016