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 A255838 #10 Mar 22 2015 19:21:13
%S A255838 1093,11,20771,491531,71,863,46021,43,2481757
%N A255838 Smallest base-b Wieferich prime larger than b, where b = prime(n).
%C A255838 a(10), if it exists, is larger than approximately 5.9*10^13, corresponding to the first odd Wieferich prime in base 29 (see Fischer link).
%H A255838 R. Fischer, <a href="http://www.fermatquotient.com/FermatQuotienten/FermQ_Sort.txt">Thema: Fermatquotient B^(P-1) == 1 (mod P^2)</a>
%o A255838 (PARI) forprime(b=1, 20, forprime(p=b, , if(Mod(b, p^2)^(p-1)==1, print1(p, ", "); break({1}))))
%Y A255838 Cf. A247072.
%K A255838 nonn,hard,more
%O A255838 1,1
%A A255838 _Felix Fröhlich_, Mar 07 2015