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 A261151 #20 Sep 08 2022 08:46:13
%S A261151 11410337850553,11871247719973,12332157589393,12793067458813,
%T A261151 13253977328233,13714887197653,14175797067073,14636706936493,
%U A261151 15097616805913,15558526675333,16019436544753,16480346414173,16941256283593,17402166153013,17863076022433,18323985891853
%N A261151 a(n) = 11410337850553 + (n-1)*4609098694200.
%C A261151 The terms n = 1..22 are prime. This is the longest known sequence of 22 primes in arithmetic progression with minimal end known as of August 10, 2015.
%H A261151 Colin Barker, <a href="/A261151/b261151.txt">Table of n, a(n) for n = 1..1000</a>
%H A261151 Jens Kruse Andersen, <a href="http://primerecords.dk/aprecords.htm#ap24">All known AP24 to AP26</a>.
%H A261151 Wikipedia, <a href="https://en.wikipedia.org/wiki/Primes_in_arithmetic_progression#Largest_known_primes_in_AP">Largest known primes in AP</a>.
%H A261151 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A261151 a(n) = 11410337850553 + (n-1)*475180*A002110(8).
%F A261151 G.f.: -x*(10949427981133*x-11410337850553) / (x-1)^2. - _Colin Barker_, Aug 25 2015
%e A261151 a(22) = 11410337850553 + 21*4609098694200 = 108201410428753 is prime.
%t A261151 Table[11410337850553 + (n - 1) 4609098694200, {n, 1, 20}]
%o A261151 (Sage) [11410337850553+(n-1)*4609098694200 for n in (1..20)]
%o A261151 (Magma) [11410337850553+(n-1)*4609098694200: n in [1..20]];
%o A261151 (PARI) Vec(-x*(10949427981133*x-11410337850553) / (x-1)^2 + O(x^40)) \\ _Colin Barker_, Aug 25 2015
%Y A261151 Cf. A005115, A002110, A204189.
%K A261151 nonn,easy
%O A261151 1,1
%A A261151 _Marco Ripà_, Aug 10 2015