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 A087102 #11 Feb 16 2025 08:32:50
%S A087102 1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,2,1,2,2,1,1,2,2,
%T A087102 1,1,1,2,2,3,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%U A087102 1,1,1,1,1,2,2,1,1,1,1,1,2,2,1,2,2,1,1,1,2,3,3,3,1,1,1,1,1,1,1,2,2,1
%N A087102 Number of numbers occurring most frequently as difference between consecutive primes <= prime(n).
%C A087102 For small n: a(n)<=3; A087103(n) and A087104(n) give the smallest and greatest jumping champion(s) for prime(n).
%H A087102 T. D. Noe, <a href="/A087102/b087102.txt">Table of n, a(n) for n = 2..1001</a>
%H A087102 A. Odlyzko, M. Rubinstein and M. Wolf, <a href="http://www.dtc.umn.edu/~odlyzko/doc/jumping.champions.pdf">Jumping Champions</a>
%H A087102 A. Odlyzko, M. Rubinstein and M. Wolf, <a href="http://www.emis.de/journals/EM/expmath/volumes/8/8.html">Jumping Champions</a>, Experimental Math., 8 (no. 2) (1999).
%H A087102 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/JumpingChampion.html">Jumping Champion</a>
%t A087102 d=Table[0, {100}]; p=2; Table[q=NextPrime[p]; d[[q-p]]++; p=q; Length[Position[d, Max[d]]], {1000}]
%Y A087102 Cf. A001223, A005250.
%K A087102 nonn
%O A087102 2,2
%A A087102 _Reinhard Zumkeller_, Aug 10 2003