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 A355964 #10 May 13 2024 00:06:24 %S A355964 13,19,2207,26041,332698495781 %N A355964 Primes p such that (p+9)^(p-1) == 1 (mod p^2). %C A355964 a(6) > 10^13 if it exists. - _Jason Yuen_, May 12 2024 %o A355964 (PARI) forprime(p=1, , if(Mod(p+9, p^2)^(p-1)==1, print1(p, ", "))) %Y A355964 (p+k)^(p-1) == 1 (mod p^2): A355959 (k=2), A355960 (k=5), A355961 (k=6), A355962 (k=7), A355963 (k=8), A355965 (k=10). %K A355964 nonn,hard,more %O A355964 1,1 %A A355964 _Felix Fröhlich_, Jul 21 2022 %E A355964 a(5) from _Jason Yuen_, May 12 2024