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 A092519 #12 Jul 26 2025 10:06:14
%S A092519 5,5,5,59,7,31,5,5,5,11,31,7,23,5,11,5,7,23,79,29,5,5,73,29,7,41,107,
%T A092519 43,19,59,11,37,13,79,13,11,17,43,359,23,31,5,53,19,47,181,137,23,59,
%U A092519 7,491,127,283,179,23,11,7,5,89,7,461,7,53,139,31,5,7,13
%N A092519 Smallest prime a(n) such that a(n)+6n, a(n)+12n and a(n)+18n are also primes.
%H A092519 Vincenzo Librandi, <a href="/A092519/b092519.txt">Table of n, a(n) for n = 1..2000</a>
%e A092519 a(5) = 7: 7+6*5 = 7+30 = 37, 7+12*5 = 7+60 = 67, and 7+18*5 = 7+90 = 97 are all prime.
%t A092519 Module[{nn=100,prs},prs=Prime[Range[nn]];Table[SelectFirst[prs, AllTrue[ #+6*Range[3]*n,PrimeQ]&],{n,nn/2}]] (* The program uses the AllTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Dec 22 2018 *)
%o A092519 (Magma) prs := [NthPrime(i) : i in [1..200]]; result := []; for n in [1..100] do for p in prs do if forall{k : k in [1..3] | IsPrime(p + 6*n*k)} then Append(~result, p); break; end if; end for; end for; result; // _Vincenzo Librandi_, Jul 26 2025
%Y A092519 a(1) starts sequence A023271.
%K A092519 nonn
%O A092519 1,1
%A A092519 _Ray G. Opao_, Apr 06 2004