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 A355965 #12 Mar 05 2024 12:04:30 %S A355965 13,41,97,809,1151,1657,800011 %N A355965 Primes p such that (p+10)^(p-1) == 1 (mod p^2). %C A355965 A computer search taking less than 3 seconds shows there are no further terms below the one millionth prime. - _Harvey P. Dale_, Mar 04 2024 %C A355965 I ran the PARI program below for 8.5 hours and it did not find any further terms. (I do not know how far it searched.) - _N. J. A. Sloane_, Mar 05 2024 %t A355965 Select[Prime[Range[70000]],PowerMod[#+10,#-1,#^2]==1&] (* _Harvey P. Dale_, Mar 04 2024 *) %o A355965 (PARI) forprime(p=1, , if(Mod(p+10, p^2)^(p-1)==1, print1(p, ", "))) %Y A355965 (p+k)^(p-1) == 1 (mod p^2): A355959 (k=2), A355960 (k=5), A355961 (k=6), A355962 (k=7), A355963 (k=8), A355964 (k=9). %K A355965 nonn,hard,more %O A355965 1,1 %A A355965 _Felix Fröhlich_, Jul 21 2022