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 A250395 #15 Sep 08 2022 08:46:10 %S A250395 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,26,30,31,41, %T A250395 43,50,57,61,69,75,88,90,98,99,101,108,116,127,128,131,132,133,146, %U A250395 154,156,159,160,162,164,165,171,172,182,183,188,191,193,194,197 %N A250395 Numbers k such that 11410337850553 + 4609098694200*k is prime. %C A250395 Terms up to 21 are consecutive. Arithmetic progression found by Pritchard et al. (1995). %H A250395 Amiram Eldar, <a href="/A250395/b250395.txt">Table of n, a(n) for n = 1..10000</a> %H A250395 Ben Green and Terence Tao, <a href="https://www.jstor.org/stable/40345354">The primes contain arbitrarily long arithmetic progressions</a>, Annals of Mathematics, Vol. 167, No. 2 (2008), pp. 481-547; <a href="http://arXiv.org/abs/math/0404188">arXiv preprint</a>, arXiv:math/0404188 [math.NT], 2004-2007. %H A250395 Paul A. Pritchard, Andrew Moran and Anthony Thyssen, <a href="https://doi.org/10.1090/S0025-5718-1995-1297475-1">Twenty-two primes in arithmetic progression</a>, Mathematics of Computation, Vol. 64, No. 211 (1995), pp. 1337-1339. %t A250395 Select[Range[0, 300], PrimeQ[11410337850553 + 4609098694200 #] &] %o A250395 (Magma) [n: n in [0..200] | IsPrime(11410337850553+4609098694200*n)]; %o A250395 (PARI) is(n)=isprime(11410337850553+4609098694200*n) \\ _Charles R Greathouse IV_, Jun 13 2017 %Y A250395 Cf. A002837, A056561, A180688, A250394. %K A250395 nonn,easy %O A250395 1,3 %A A250395 _Vincenzo Librandi_, Nov 21 2014