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 A357363 #4 Oct 01 2022 19:35:19 %S A357363 5,19,263,1667 %N A357363 Primes p such that either p^(q-1) == 1 (mod q^2) or q^(p-1) == 1 (mod p^2), where q = A151800(A151800(p)). %o A357363 (PARI) is(n) = my(b=precprime(precprime(n-1)-1)); Mod(b, n^2)^(n-1)==1 || Mod(n, b^2)^(b-1)==1 %o A357363 forprime(p=5, , if(is(p), print1(p, ", "))) %Y A357363 Cf. A151800, A357362, A357364, A357365. %K A357363 nonn,hard,more %O A357363 1,1 %A A357363 _Felix Fröhlich_, Sep 25 2022