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 A382285 #17 Mar 28 2025 15:59:28
%S A382285 241639,44533249,120833809,245843149,480454939,547838359,945331939,
%T A382285 1272712579,1318911019,1334157859,1413122899,1801178629,1977960949,
%U A382285 2708995099,3073533559,3234255499,3359304829,3485412349,3836960419,4202567899,4311168259,4984840999,5044981129
%N A382285 Initial members of prime octuplets (p, p+4, p+12, p+24, p+28, p+40, p+48, p+52), where all primes are consecutive primes.
%C A382285 All gaps are twice the length of respective gaps in the prime octuplet form, (p, p+2, p+6, p+12, p+14, p+20, p+24, p+26). See A022012 for initial members of that pattern.
%C A382285 Terms are congruent to 19 (mod 30).
%C A382285 It is conjectured that there is an infinite number of primes for every admissible k-tuple.
%H A382285 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/k-TupleConjecture.html">k-Tuple Conjecture</a>.
%o A382285 (PARI) list(lim) = {my(d0 = [4, 8, 12, 4, 12, 8, 4], s = vecsum(d0), d = vector(7, i, prime(i+1) - prime(i)), prv = 19); forprime(p = 23, lim, d = concat(vecextract(d, "^1"), p - prv); if(d == d0, print1(p - s, ", ")); prv = p);} \\ _Amiram Eldar_, Mar 21 2025
%Y A382285 Cf. A022012.
%K A382285 nonn
%O A382285 1,1
%A A382285 _Federico Salas_, Mar 20 2025
%E A382285 More terms from _Amiram Eldar_, Mar 21 2025