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 A189684 #21 Oct 09 2019 20:56:53
%S A189684 0,0,0,0,0,1,0,1,1,2,2,2,1,2,2,3,1,1,1,2,1,4,2,3,2,4,3,3,4,3,4,2,2,4,
%T A189684 3,2,1,2,3,5,3,5,3,3,3,3,5,5,5,5,5,3,4,3,5,3,1,4,1,3,3,7,3,6,5,3,4,3,
%U A189684 7,6,3,2,6,6,6,5,6,5,7,5,4,7,8,5,3,2,7
%N A189684 Number of irregular pairs (p,2n).
%C A189684 a(n) is the number of primes p >= 2n+3 that divide the numerator of the Bernoulli number B_{2n}.
%H A189684 B. Mazur, <a href="https://doi.org/10.1090/S0273-0979-2011-01326-X">How can we construct abelian Galois extensions of basic number fields?</a>, Bull. Amer. Math. Soc., 48 (2011), 155-209. See footnote 64 on p. 205.
%H A189684 Samual S. Wagstaff, Jr., <a href="http://homes.cerias.purdue.edu/~ssw/bernoulli/full.pdf">Prime divisors of the Bernoulli and Euler numbers</a>
%H A189684 Wikipedia, <a href="http://en.wikipedia.org/wiki/Regular_prime#Irregular_pairs"> Irregular pairs</a>
%t A189684 Table[p = Select[First /@ FactorInteger[Abs[Numerator[BernoulliB[2n]]]], # >= 2*n+3 &]; Length[p], {n, 35}] (* _T. D. Noe_, Apr 25 2011 *)
%Y A189684 Cf. A000367, A000928, A035112, A046753, A189683, A189685.
%K A189684 nonn
%O A189684 1,10
%A A189684 _Jonathan Sondow_, Apr 25 2011