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 A101042 #8 Nov 16 2019 03:50:14 %S A101042 1,2,6,22,116,88,470,112,284,242,202,772,1326,718,1334,1328,2558,1762, %T A101042 1642,2402,3274,1732,7094,9512,7984,5246,12688,10532,9952,16766,7702, %U A101042 60458,9974,25708,5888,13528,10342,25678,62156,69518,76838,37666 %N A101042 a(n) is the smallest positive d such that the n-th prime is the smallest prime p for which p+d is also prime. %C A101042 Except for n=1, A020483(a(n)/2) is the first appearance of the n-th prime. It is conjectured that a(n) always exists. a(386) is the first number which must be above 10^12. %H A101042 J. K. Andersen, <a href="http://groups.yahoo.com/group/primenumbers/message/15641">Prime gaps (not necessarily consecutive)</a>. %H A101042 Mike Oakes, Ed Pegg Jr, Jens Kruse Andersen, <a href="/A101042/a101042.txt">Prime gaps (not necessarily consecutive)</a>, digest of 5 messages in primenumbers Yahoo group, Nov 26 - Nov 27, 2004. [Cached copy] %e A101042 a(3)=6 because: The 3rd prime is 5. 2+6, 3+6 is composite, 5+6 is prime. 6 is the smallest such number. %Y A101042 Cf. A020483, A101043, A101044, A101045, A101046. %K A101042 nonn %O A101042 1,2 %A A101042 _Jens Kruse Andersen_, Nov 28 2004