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 A355963 #8 Aug 24 2022 09:55:00 %S A355963 1531,7445287 %N A355963 Primes p such that (p+8)^(p-1) == 1 (mod p^2). %C A355963 a(3) > 34294200797 if it exists. %o A355963 (PARI) forprime(p=1, , if(Mod(p+8, p^2)^(p-1)==1, print1(p, ", "))) %Y A355963 (p+k)^(p-1) == 1 (mod p^2): A355959 (k=2), A355960 (k=5), A355961 (k=6), A355962 (k=7), A355964 (k=9), A355965 (k=10). %K A355963 nonn,hard,more,bref %O A355963 1,1 %A A355963 _Felix Fröhlich_, Jul 21 2022