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 A060974 #7 Mar 05 2019 10:43:36
%S A060974 157,353,379,467,491,547,587,617,631,647,673,691,809,929,1151,1217,
%T A060974 1291,1297,1307,1663,1669,1733,1789,1811,1847,1933,1997,2003,2087,
%U A060974 2273,2309,2371,2383,2423,2441,2591,2671,2789,2909,2939,2957,3391,3407,3511
%N A060974 Irregular primes with irregularity > 1.
%H A060974 Amiram Eldar, <a href="/A060974/b060974.txt">Table of n, a(n) for n = 1..10000</a> (from Hart et al.)
%H A060974 William Hart, David Harvey and Wilson Ong, <a href="https://doi.org/10.1090/mcom/3211">Irregular primes to two billion</a>, Mathematics of Computation, Vol. 86, No. 308 (2017), pp. 3031-3049; also available at <a href="https://arxiv.org/abs/1605.02398">arXiv:1605.02398 [math.NT]</a>, 2016.
%H A060974 David Harvey, <a href="https://web.maths.unsw.edu.au/~davidharvey/papers/twobillion/">Irregular primes to two billion</a> (includes a list of all primes less than 2^31).
%t A060974 Do[ p = Prime[ n ]; c = 0; k = 1; While[ 2*k < p - 3, If[ Mod[ Numerator[ BernoulliB[ 2*k ] ], p ] == 0, c++ ]; k++ ]; If[ c > 1, Print[ p ] ], {n, 3, 750} ]
%Y A060974 Cf. A000928, A000367, A060975, A073276, A073277 and A073278.
%K A060974 nonn
%O A060974 1,1
%A A060974 _Robert G. Wilson v_, May 09 2001