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 A274994 #46 Apr 27 2019 05:43:22
%S A274994 3,1093,3511,9511,13691
%N A274994 Primes p such that p^2 divides Sum_{k=1..(p-1)/2} (k^(p-2))*(k^(p-1)-1).
%C A274994 Any prime p divides Sum_{k=1..(p-1)/2} (k^(p-2))*(k^(p-1)-1). But a restricted list of primes p are such that p^2 divides Sum_{k=1..(p-1)/2}(k^(p-2))*(k^(p-1)-1).
%C A274994 Also primes p such that (2^(p-1)-1)/p == 0 (mod p) or 2*((p-1)!+1)/p +(2^(p-1)-1)/p == 0 (mod p), because it can be shown that Sum_{k=1..(p-1)/2} (k^(p-2))*(k^(p-1)-1) == p*((2^(p-1)-1)/p)*(2*((p-1)!+1)/p +(2^(p-1)-1)/p) (mod p^2).
%C A274994 The Wieferich primes (A001220) belong to the sequence.
%C A274994 No more terms up to 2000000, because A280300 has no more terms up to 2000000, and A001220 has no other terms below 4.97*10^17 (see the comments in these sequences). - _René Gy_, Jan 01 2017
%H A274994 Amir Akbary and Sahar Siavashi, <a href="http://math.colgate.edu/~integers/s3/s3.Abstract.html">The Largest Known Wieferich Numbers</a>, INTEGERS, 18(2018), A3. See Table 1 p. 5.
%t A274994 p=3; While[p<20000, If[Mod[Sum[PowerMod[k,p-2,p^2]*(PowerMod[k,p-1,p^2]-1), {k,1,(p-1)/2}], p^2] == 0, Print [p]]; p=NextPrime[p]]
%o A274994 (PARI) is(n)=if(!isprime(n), return(0)); my(m=n^2,e=n-2); sum(k=1,n\2, Mod(k,m)^e*(Mod(k,m)^(e+1)-1))==0 && n>2 \\ _Charles R Greathouse IV_, Nov 13 2016
%Y A274994 Equals the union of A001220 and A280300.
%K A274994 nonn,more
%O A274994 1,1
%A A274994 _René Gy_, Nov 11 2016