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 A348053 #12 Jun 26 2022 09:08:32 %S A348053 1369391,87613571,1172531,216646267,251331775687,214159878489239, %T A348053 523250002674163757 %N A348053 Alternative version of A332493 (Skewes number for prime n-tuplets). %C A348053 In contrast to A332493, in which "latest occurrence" is defined as the largest numerical value of the start of the n-tuplet, the maximum of the position of the occurrence is used here. This distinction is necessary for the first time with the term a(8), because there are 3 possible patterns of 8-tuplets. The 8-tuplet p + [0, 2, 6, 8, 12, 18, 20, 26] leads to A210439(8) = 1203255673037261. Of the two remaining candidates, p + [0, 2, 6, 12, 14, 20, 24, 26] leads to the Hardy-Littlewood prediction being exceeded at the 40634356th 8-tuplet with this pattern, the initial member of which is a(8)=523250002674163757. The other pattern p + [0, 6, 8, 14, 18, 20, 24, 26] leads to the 20316822th 8-tuplet with the beginning A332493(8) = 750247439134737983. %H A348053 Tony Forbes and Norman Luhn, <a href="https://pzktupel.de/ktpatt_hl.php">Patterns of prime k-tuplets & the Hardy-Littlewood constants</a>. %H A348053 Norman Luhn, <a href="http://www.pzktupel.de/smarchive.html">Database of the smallest prime k-tuplets</a>, compressed files. %H A348053 Hugo Pfoertner, <a href="/A332493/a332493_1.pdf">Comparison of number of octuplets needed to achieve the H-L prediction</a>, (2021). %Y A348053 Cf. A210439, A332493. %K A348053 nonn,more,hard %O A348053 2,1 %A A348053 _Hugo Pfoertner_, Oct 21 2021 %E A348053 a(8) from _Norman Luhn_, Sep 11 2021