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 A206043 #31 Jan 08 2023 08:18:48
%S A206043 32671170,54130440,59806740,145727400,224494620,246632190,280723800,
%T A206043 301125300,356845020,440379870,486229380,601904940,676987920,
%U A206043 777534660,785544480,789052530,799786890,943698210,1535452800,1536160080,1760583300,1808008020
%N A206043 Values of the difference d for 9 primes in arithmetic progression with the minimal start sequence {11 + j*d}, j = 0 to 8.
%C A206043 The computations were done without any assumptions on the form of d.
%H A206043 Charles R Greathouse IV, <a href="/A206043/b206043.txt">Table of n, a(n) for n = 1..1419</a>
%H A206043 Sameen Ahmed Khan, <a href="http://arxiv.org/abs/1203.2083">Primes in Geometric-Arithmetic Progression</a>, arXiv preprint arXiv:1203.2083 [math.NT], 2012. - From _N. J. A. Sloane_, Sep 15 2012
%e A206043 d = 54130440 then {11, 54130451, 108260891, 162391331, 216521771, 270652211, 324782651, 378913091, 433043531} which is 9 primes in arithmetic progression.
%t A206043 a = 11; t = {}; Do[If[PrimeQ[{a, a + d, a + 2*d, a + 3*d, a + 4*d, a + 5*d, a + 6*d, a + 7*d, a + 8*d}] == {True, True, True, True, True, True, True, True, True}, AppendTo[t,d]], {d, 10^9}]; t
%o A206043 (PARI) forstep(k=210,1e10,210,forstep(p=k+11,8*k+11,k,if(!isprime(p), next(2)));print1(k", ")) \\ _Charles R Greathouse IV_, Feb 09 2012
%Y A206043 Cf. A040976, A206037, A206038, A206039, A206040, A206041, A206042, A206044, A206045.
%K A206043 nonn
%O A206043 1,1
%A A206043 _Sameen Ahmed Khan_, Feb 03 2012
%E A206043 a(20) corrected by _Charles R Greathouse IV_, Feb 09 2012