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 A376013 #33 Sep 19 2024 08:32:01
%S A376013 23,41,59,131,311,941,1049,1931,2579,3911,4289,4451,6719,8069,10391,
%T A376013 10589,12011,14369,26591,31379,33521,35339,41081,43889,58271,59981,
%U A376013 63059,64679,66821,74759,77999,78791,80051,80141,83219,87071,94541,96179
%N A376013 Prime numbers of the form 3p+8 where p, p+2 and p+6 are prime numbers.
%C A376013 An integer n is in this list if it is a prime number and (n-8)/3, (n-2)/3, (n+10)/3 are all prime numbers. 23 is a term because it is prime and 5, 7 and 11 are prime numbers.
%H A376013 Daniel Mondot, <a href="/A376013/b376013.txt">Table of n, a(n) for n = 1..10000</a>
%F A376013 a(n) = 3*A162001(n) + 8. - _Daniel Mondot_, Sep 06 2024
%F A376013 a(n) == 5 (mod 6). - _Hugo Pfoertner_, Sep 06 2024
%F A376013 a(n) >> n log^4 n. - _Charles R Greathouse IV_, Sep 18 2024
%e A376013 5 + 7 + 11 = 23;
%e A376013 11 + 13 + 17 = 41;
%e A376013 17 + 19 + 23 = 59;
%e A376013 41 + 43 + 47 = 131;
%e A376013 101 + 103 + 107 = 311;
%e A376013 311 + 313 + 317 = 941;
%e A376013 347 + 349 + 353 = 1049;
%e A376013 ...
%t A376013 Select[Total /@ Select[Partition[Prime[Range[3500]], 3, 1], Differences[#] == {2, 4} &], PrimeQ] (* _Amiram Eldar_, Sep 06 2024 *)
%o A376013 (PARI) list(lim)=my(v=List(),p=5,q=7,s); forprime(r=11,(lim+10)\3, if(r-p==6 && q-p==2 && isprime(s=3*p+8), listput(v,s)); p=q; q=r); Vec(v) \\ _Charles R Greathouse IV_, Sep 18 2024
%Y A376013 Cf. A162001, A104160.
%K A376013 nonn
%O A376013 1,1
%A A376013 _Zak Seidov_, Sep 06 2024