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 A266961 #20 Mar 29 2016 23:54:19 %S A266961 11281963036964038421,12114914563464663491,28316206187385412991, %T A266961 52124021311991227601,55545706433252188001,111634607435934869981, %U A266961 507606513146890423961,530175308664549244391,635491296817562023841,730968587426043396971,768781285931309901791,780090878823500745041 %N A266961 Initial members of two prime quadruple pairs (A059925) with the smallest possible difference of 420. %C A266961 Numbers n such that {n, n + 2, n + 6, n + 8, n + 30, n + 32, n + 36, n + 38, n + 420, n + 422, n + 426, n + 428, n + 450, n + 452, n + 456, n + 458} are all prime. %C A266961 All terms are congruent to 2081 (mod 2310) as all primes up to 11 only have one admissible modulo class for this constellation. %H A266961 Roman Ludwig, <a href="/A266961/b266961.txt">Table of n, a(n) for n = 1..75 (all constellations up to 10^22)</a> %H A266961 Jens Kruse Andersen, <a href="https://groups.google.com/d/msg/alt.math.recreational/kuWdOwLAZZw/IbyeFzel50kJ">Special Twin Prime Constellations</a> %H A266961 Joerg Waldvogel, <a href="http://www.sam.math.ethz.ch/~joergw/Projects/clprimes05.pdf">Finding Clusters of Primes</a> %Y A266961 Cf. A007530, A059925. %K A266961 nonn %O A266961 1,1 %A A266961 _Roman Ludwig_, Jan 07 2016