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 A355961 #6 Aug 24 2022 09:54:18 %S A355961 13,47,3803,151051,240727,259933847 %N A355961 Primes p such that (p+6)^(p-1) == 1 (mod p^2). %o A355961 (PARI) forprime(p=1, , if(Mod(p+6, p^2)^(p-1)==1, print1(p, ", "))) %Y A355961 (p+k)^(p-1) == 1 (mod p^2): A355959 (k=2), A355960 (k=5), A355962 (k=7), A355963 (k=8), A355964 (k=9), A355965 (k=10). %K A355961 nonn,hard,more %O A355961 1,1 %A A355961 _Felix Fröhlich_, Jul 21 2022