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 A260377 #5 Jul 23 2015 17:45:54 %S A260377 3,5,17,257,1093,3511,65537,1006003 %N A260377 Primes p such that A001221(p-1)^(p-1) == 1 (mod p^2). %C A260377 No further terms up to 10^9. %C A260377 All currently (as of 2015-07-23) known terms of A001220 and A019434 are in the sequence, as is A014127(2), but A014127(1) is not. %e A260377 A001221(1092) == 4 and 4^1092 == 1 (mod 1093^2), so 1093 is a term of the sequence. %o A260377 (PARI) forprime(p=1, 1e9, if(Mod(omega(p-1), p^2)^(p-1)==1, print1(p, ", "))) %Y A260377 Cf. A001220, A014127, A019434, A244546. %K A260377 nonn,hard,more %O A260377 1,1 %A A260377 _Felix Fröhlich_, Jul 23 2015